Base | Representation |
---|---|
bin | 1000100110111100… |
… | …01000101001010011 |
3 | 102221002102100011111 |
4 | 10103132020221103 |
5 | 33431114243011 |
6 | 2042333354151 |
7 | 222346145662 |
oct | 42336105123 |
9 | 12832370144 |
10 | 4621634131 |
11 | 1a61879144 |
12 | a8b938957 |
13 | 58865346a |
14 | 31bb2cdd9 |
15 | 1c0b18121 |
hex | 113788a53 |
4621634131 has 4 divisors (see below), whose sum is σ = 4621854600. Its totient is φ = 4621413664.
The previous prime is 4621634113. The next prime is 4621634141. The reversal of 4621634131 is 1314361264.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4621634131 - 29 = 4621633619 is a prime.
It is a super-2 number, since 2×46216341312 = 42719004081648250322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4621634093 and 4621634102.
It is not an unprimeable number, because it can be changed into a prime (4621634141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75046 + ... + 121963.
It is an arithmetic number, because the mean of its divisors is an integer number (1155463650).
Almost surely, 24621634131 is an apocalyptic number.
4621634131 is a deficient number, since it is larger than the sum of its proper divisors (220469).
4621634131 is a wasteful number, since it uses less digits than its factorization.
4621634131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220468.
The product of its digits is 10368, while the sum is 31.
The square root of 4621634131 is about 67982.6016786648. The cubic root of 4621634131 is about 1665.7066539626.
Adding to 4621634131 its reverse (1314361264), we get a palindrome (5935995395).
The spelling of 4621634131 in words is "four billion, six hundred twenty-one million, six hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •