Base | Representation |
---|---|
bin | 1001001001100100011011… |
… | …00101110101101001111111 |
3 | 2122020110020120000001000000 |
4 | 10210302031211311221333 |
5 | 10114121231043233043 |
6 | 110443000152205343 |
7 | 4144423261642053 |
oct | 444621545655177 |
9 | 78213216001000 |
10 | 20120002321023 |
11 | 6457932867a60 |
12 | 230b484099853 |
13 | b2c400b01697 |
14 | 4d7b55a09c63 |
15 | 24d57a1492d3 |
hex | 124c8d975a7f |
20120002321023 has 112 divisors (see below), whose sum is σ = 33552386177184. Its totient is φ = 11957320673280.
The previous prime is 20120002321019. The next prime is 20120002321033. The reversal of 20120002321023 is 32012320002102.
20120002321023 is a `hidden beast` number, since 201 + 200 + 0 + 232 + 10 + 23 = 666.
It is not a de Polignac number, because 20120002321023 - 22 = 20120002321019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20120002320987 and 20120002321005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120002321033) by changing a digit.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 101172615 + ... + 101371287.
It is an arithmetic number, because the mean of its divisors is an integer number (299574876582).
Almost surely, 220120002321023 is an apocalyptic number.
20120002321023 is a deficient number, since it is larger than the sum of its proper divisors (13432383856161).
20120002321023 is a wasteful number, since it uses less digits than its factorization.
20120002321023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198948 (or 198933 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 20120002321023 its reverse (32012320002102), we get a palindrome (52132322323125).
The spelling of 20120002321023 in words is "twenty trillion, one hundred twenty billion, two million, three hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •