Base | Representation |
---|---|
bin | 10010101111010000… |
… | …001101011000110011 |
3 | 1220221012120120011121 |
4 | 102233100031120303 |
5 | 312201223143443 |
6 | 13124300123111 |
7 | 1311411202261 |
oct | 225720153063 |
9 | 56835516147 |
10 | 20120131123 |
11 | 8595320344 |
12 | 3a96236497 |
13 | 1b88549441 |
14 | d8c237431 |
15 | 7cb59a4ed |
hex | 4af40d633 |
20120131123 has 2 divisors, whose sum is σ = 20120131124. Its totient is φ = 20120131122.
The previous prime is 20120131117. The next prime is 20120131133. The reversal of 20120131123 is 32113102102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20120131123 - 217 = 20120000051 is a prime.
It is a super-2 number, since 2×201201311232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20120131097 and 20120131106.
It is not a weakly prime, because it can be changed into another prime (20120131103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10060065561 + 10060065562.
It is an arithmetic number, because the mean of its divisors is an integer number (10060065562).
Almost surely, 220120131123 is an apocalyptic number.
20120131123 is a deficient number, since it is larger than the sum of its proper divisors (1).
20120131123 is an equidigital number, since it uses as much as digits as its factorization.
20120131123 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 20120131123 its reverse (32113102102), we get a palindrome (52233233225).
It can be divided in two parts, 201201 and 31123, that added together give a square (232324 = 4822).
The spelling of 20120131123 in words is "twenty billion, one hundred twenty million, one hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •