Base | Representation |
---|---|
bin | 111110110111011010101… |
… | …000010100001101101001 |
3 | 120021222221220101101112112 |
4 | 332313122220110031221 |
5 | 1031240041143242441 |
6 | 13104344201052105 |
7 | 624055233153215 |
oct | 76673250241551 |
9 | 16258856341475 |
10 | 4320110134121 |
11 | 141616a600321 |
12 | 599324187035 |
13 | 254500083392 |
14 | 10d147235945 |
15 | 77598ddc4eb |
hex | 3eddaa14369 |
4320110134121 has 2 divisors, whose sum is σ = 4320110134122. Its totient is φ = 4320110134120.
The previous prime is 4320110134103. The next prime is 4320110134127. The reversal of 4320110134121 is 1214310110234.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4255969000000 + 64141134121 = 2063000^2 + 253261^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4320110134121 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (4320110134127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2160055067060 + 2160055067061.
It is an arithmetic number, because the mean of its divisors is an integer number (2160055067061).
Almost surely, 24320110134121 is an apocalyptic number.
It is an amenable number.
4320110134121 is a deficient number, since it is larger than the sum of its proper divisors (1).
4320110134121 is an equidigital number, since it uses as much as digits as its factorization.
4320110134121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 4320110134121 its reverse (1214310110234), we get a palindrome (5534420244355).
The spelling of 4320110134121 in words is "four trillion, three hundred twenty billion, one hundred ten million, one hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •