Base | Representation |
---|---|
bin | 1001001011111011100001… |
… | …01100111110000111000111 |
3 | 2122112012121221001012222200 |
4 | 10211331300230332013013 |
5 | 10121433344214430043 |
6 | 110544133425125543 |
7 | 4153324431044304 |
oct | 445756054760707 |
9 | 78465557035880 |
10 | 20201122030023 |
11 | 648927a81aa80 |
12 | 2323142a898b3 |
13 | b36c5abc7cac |
14 | 4dba4d3740ab |
15 | 250726a937d3 |
hex | 125f70b3e1c7 |
20201122030023 has 24 divisors (see below), whose sum is σ = 31888611256320. Its totient is φ = 12221358038160.
The previous prime is 20201122030013. The next prime is 20201122030091. The reversal of 20201122030023 is 32003022110202.
20201122030023 is a `hidden beast` number, since 20 + 201 + 122 + 0 + 300 + 23 = 666.
It is not a de Polignac number, because 20201122030023 - 210 = 20201122028999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20201122029978 and 20201122030005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20201122030013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 181162503 + ... + 181273976.
It is an arithmetic number, because the mean of its divisors is an integer number (1328692135680).
Almost surely, 220201122030023 is an apocalyptic number.
20201122030023 is a deficient number, since it is larger than the sum of its proper divisors (11687489226297).
20201122030023 is a wasteful number, since it uses less digits than its factorization.
20201122030023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362437059 (or 362437056 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 20201122030023 its reverse (32003022110202), we get a palindrome (52204144140225).
The spelling of 20201122030023 in words is "twenty trillion, two hundred one billion, one hundred twenty-two million, thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •