Base | Representation |
---|---|
bin | 1001001001010101111010… |
… | …01000100111100101111111 |
3 | 2122012201010111102210101202 |
4 | 10210222331020213211333 |
5 | 10114004301232024043 |
6 | 110435231032330115 |
7 | 4144026212406203 |
oct | 444527510474577 |
9 | 78181114383352 |
10 | 20112210033023 |
11 | 64545a426a719 |
12 | 2309a6a54393b |
13 | b2b75b615b94 |
14 | 4d7616b70b03 |
15 | 24d270ecd1b8 |
hex | 124abd22797f |
20112210033023 has 8 divisors (see below), whose sum is σ = 20125802817456. Its totient is φ = 20098618257600.
The previous prime is 20112210033011. The next prime is 20112210033077. The reversal of 20112210033023 is 32033001221102.
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 20112210033023 - 210 = 20112210031999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20112210032986 and 20112210033004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112210033623) 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, 42010883 + ... + 42486923.
It is an arithmetic number, because the mean of its divisors is an integer number (2515725352182).
Almost surely, 220112210033023 is an apocalyptic number.
20112210033023 is a deficient number, since it is larger than the sum of its proper divisors (13592784433).
20112210033023 is a wasteful number, since it uses less digits than its factorization.
20112210033023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504505.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20112210033023 its reverse (32033001221102), we get a palindrome (52145211254125).
The spelling of 20112210033023 in words is "twenty trillion, one hundred twelve billion, two hundred ten million, thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •