Base | Representation |
---|---|
bin | 1000100110110001… |
… | …01111101100101111 |
3 | 102220222202120000212 |
4 | 10103120233230233 |
5 | 33430234034411 |
6 | 2042243213035 |
7 | 222331142513 |
oct | 42330575457 |
9 | 12828676025 |
10 | 4620221231 |
11 | 1a60aa365a |
12 | a8b37717b |
13 | 58827a322 |
14 | 31b882143 |
15 | 1c093968b |
hex | 11362fb2f |
4620221231 has 2 divisors, whose sum is σ = 4620221232. Its totient is φ = 4620221230.
The previous prime is 4620221219. The next prime is 4620221237. The reversal of 4620221231 is 1321220264.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4620221231 - 26 = 4620221167 is a prime.
It is a super-2 number, since 2×46202212312 = 42692888446766310722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4620221197 and 4620221206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4620221237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2310110615 + 2310110616.
It is an arithmetic number, because the mean of its divisors is an integer number (2310110616).
Almost surely, 24620221231 is an apocalyptic number.
4620221231 is a deficient number, since it is larger than the sum of its proper divisors (1).
4620221231 is an equidigital number, since it uses as much as digits as its factorization.
4620221231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 4620221231 is about 67972.2092549595. The cubic root of 4620221231 is about 1665.5368931713.
Adding to 4620221231 its reverse (1321220264), we get a palindrome (5941441495).
The spelling of 4620221231 in words is "four billion, six hundred twenty million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •