Base | Representation |
---|---|
bin | 1001000110001010111001… |
… | …11100010011110010001111 |
3 | 2121211021210221020121212100 |
4 | 10203011130330103302033 |
5 | 10110213044313323043 |
6 | 110313204153010143 |
7 | 4133120326455006 |
oct | 443053474236217 |
9 | 77737727217770 |
10 | 20003222011023 |
11 | 6412356384669 |
12 | 22b09126b3953 |
13 | b213ac98b134 |
14 | 4d2238135c3d |
15 | 24a4e2b80cd3 |
hex | 12315cf13c8f |
20003222011023 has 24 divisors (see below), whose sum is σ = 29102051487600. Its totient is φ = 13239488110464.
The previous prime is 20003222010953. The next prime is 20003222011039. The reversal of 20003222011023 is 32011022230002.
It is not a de Polignac number, because 20003222011023 - 213 = 20003222002831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20003222010987 and 20003222011005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20003222111023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9068128 + ... + 11056101.
It is an arithmetic number, because the mean of its divisors is an integer number (1212585478650).
Almost surely, 220003222011023 is an apocalyptic number.
20003222011023 is a deficient number, since it is larger than the sum of its proper divisors (9098829476577).
20003222011023 is a wasteful number, since it uses less digits than its factorization.
20003222011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20125031 (or 20125028 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 20003222011023 its reverse (32011022230002), we get a palindrome (52014244241025).
The spelling of 20003222011023 in words is "twenty trillion, three billion, two hundred twenty-two million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •