Base | Representation |
---|---|
bin | 1001001000111111011000… |
… | …00011011110001011101111 |
3 | 2122011112220101102211122222 |
4 | 10210133230003132023233 |
5 | 10113310012222423043 |
6 | 110425510352225555 |
7 | 4143120343435523 |
oct | 444375403361357 |
9 | 78145811384588 |
10 | 20100112311023 |
11 | 644a456433068 |
12 | 2307652b3b2bb |
13 | b2a5811576b4 |
14 | 4d6bca195d83 |
15 | 24ccb3da7d68 |
hex | 1247ec0de2ef |
20100112311023 has 8 divisors (see below), whose sum is σ = 20159160838800. Its totient is φ = 20041070238720.
The previous prime is 20100112311011. The next prime is 20100112311043. The reversal of 20100112311023 is 32011321100102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20100112311023 - 28 = 20100112310767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20100112310992 and 20100112311010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100112311043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4658333 + ... + 7867673.
It is an arithmetic number, because the mean of its divisors is an integer number (2519895104850).
Almost surely, 220100112311023 is an apocalyptic number.
20100112311023 is a deficient number, since it is larger than the sum of its proper divisors (59048527777).
20100112311023 is a wasteful number, since it uses less digits than its factorization.
20100112311023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3227737.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 20100112311023 its reverse (32011321100102), we get a palindrome (52111433411125).
The spelling of 20100112311023 in words is "twenty trillion, one hundred billion, one hundred twelve million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •