Base | Representation |
---|---|
bin | 110111111011010100… |
… | …1111101010001101111 |
3 | 102111000010200112211121 |
4 | 1233312221331101233 |
5 | 3431432142423043 |
6 | 131101345201411 |
7 | 11451150541162 |
oct | 1576651752157 |
9 | 374003615747 |
10 | 120102311023 |
11 | 46a31694992 |
12 | 1b33a030267 |
13 | b430459a36 |
14 | 5b54b79ad9 |
15 | 31cde64ded |
hex | 1bf6a7d46f |
120102311023 has 2 divisors, whose sum is σ = 120102311024. Its totient is φ = 120102311022.
The previous prime is 120102311009. The next prime is 120102311033. The reversal of 120102311023 is 320113201021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120102311023 - 233 = 111512376431 is a prime.
It is a super-3 number, since 3×1201023110233 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 120102310988 and 120102311006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120102311033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60051155511 + 60051155512.
It is an arithmetic number, because the mean of its divisors is an integer number (60051155512).
Almost surely, 2120102311023 is an apocalyptic number.
120102311023 is a deficient number, since it is larger than the sum of its proper divisors (1).
120102311023 is an equidigital number, since it uses as much as digits as its factorization.
120102311023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 120102311023 its reverse (320113201021), we get a palindrome (440215512044).
The spelling of 120102311023 in words is "one hundred twenty billion, one hundred two million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •