Base | Representation |
---|---|
bin | 110111111011010101… |
… | …1010100000000001101 |
3 | 102111000011100121010021 |
4 | 1233312223110000031 |
5 | 3431432240310003 |
6 | 131101400542141 |
7 | 11451153550633 |
oct | 1576653240015 |
9 | 374004317107 |
10 | 120102666253 |
11 | 46a31907869 |
12 | 1b33a181951 |
13 | b43055262b |
14 | 5b54c2d353 |
15 | 31cded52bd |
hex | 1bf6ad400d |
120102666253 has 2 divisors, whose sum is σ = 120102666254. Its totient is φ = 120102666252.
The previous prime is 120102666193. The next prime is 120102666269. The reversal of 120102666253 is 352666201021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112384516644 + 7718149609 = 335238^2 + 87853^2 .
It is an emirp because it is prime and its reverse (352666201021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120102666253 - 213 = 120102658061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120102661253) 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, 60051333126 + 60051333127.
It is an arithmetic number, because the mean of its divisors is an integer number (60051333127).
Almost surely, 2120102666253 is an apocalyptic number.
It is an amenable number.
120102666253 is a deficient number, since it is larger than the sum of its proper divisors (1).
120102666253 is an equidigital number, since it uses as much as digits as its factorization.
120102666253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 120102666253 its reverse (352666201021), we get a palindrome (472768867274).
The spelling of 120102666253 in words is "one hundred twenty billion, one hundred two million, six hundred sixty-six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •