Base | Representation |
---|---|
bin | 10010101111011100… |
… | …000000001111100101 |
3 | 1220221102101122110001 |
4 | 102233130000033211 |
5 | 312203021114023 |
6 | 13124450301301 |
7 | 1311446400445 |
oct | 225734001745 |
9 | 56842348401 |
10 | 20123223013 |
11 | 8597042323 |
12 | 3a97287831 |
13 | 1b8908c86a |
14 | d8c800125 |
15 | 7cb9ab6ad |
hex | 4af7003e5 |
20123223013 has 2 divisors, whose sum is σ = 20123223014. Its totient is φ = 20123223012.
The previous prime is 20123222993. The next prime is 20123223031. The reversal of 20123223013 is 31032232102.
Together with next prime (20123223031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19734068484 + 389154529 = 140478^2 + 19727^2 .
It is a cyclic number.
It is not a de Polignac number, because 20123223013 - 29 = 20123222501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20123223053) 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, 10061611506 + 10061611507.
It is an arithmetic number, because the mean of its divisors is an integer number (10061611507).
Almost surely, 220123223013 is an apocalyptic number.
It is an amenable number.
20123223013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20123223013 is an equidigital number, since it uses as much as digits as its factorization.
20123223013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20123223013 its reverse (31032232102), we get a palindrome (51155455115).
The spelling of 20123223013 in words is "twenty billion, one hundred twenty-three million, two hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •