Base | Representation |
---|---|
bin | 1001010010111001001110… |
… | …0101001111110011110111 |
3 | 1100012001010112102110001202 |
4 | 2110232103211033303313 |
5 | 2314421434010241043 |
6 | 33423032504043115 |
7 | 2103246106641140 |
oct | 224562345176367 |
9 | 40161115373052 |
10 | 10220203212023 |
11 | 3290400300462 |
12 | 11908b146349b |
13 | 5919b7c9260c |
14 | 2749364b2ac7 |
15 | 12acb6dc41b8 |
hex | 94b9394fcf7 |
10220203212023 has 8 divisors (see below), whose sum is σ = 11844742556160. Its totient is φ = 8636791446360.
The previous prime is 10220203212017. The next prime is 10220203212077. The reversal of 10220203212023 is 32021230202201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10220203212023 - 214 = 10220203195639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10220203211986 and 10220203212004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220203212013) 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, 10281894083 + ... + 10281895076.
It is an arithmetic number, because the mean of its divisors is an integer number (1480592819520).
Almost surely, 210220203212023 is an apocalyptic number.
10220203212023 is a deficient number, since it is larger than the sum of its proper divisors (1624539344137).
10220203212023 is an equidigital number, since it uses as much as digits as its factorization.
10220203212023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20563789237.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 10220203212023 its reverse (32021230202201), we get a palindrome (42241433414224).
The spelling of 10220203212023 in words is "ten trillion, two hundred twenty billion, two hundred three million, two hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •