Base | Representation |
---|---|
bin | 1001000111011010111101… |
… | …0101010100001011000111 |
3 | 1022111012101002112011220222 |
4 | 2101312233111110023013 |
5 | 2303204302134131043 |
6 | 33152314304414555 |
7 | 2053100524564514 |
oct | 221665725241307 |
9 | 38435332464828 |
10 | 10023100302023 |
11 | 3214855900916 |
12 | 115a66401745b |
13 | 579235c357a3 |
14 | 26919908a30b |
15 | 125acce66d68 |
hex | 91daf5542c7 |
10023100302023 has 16 divisors (see below), whose sum is σ = 10303283105280. Its totient is φ = 9745144928064.
The previous prime is 10023100301989. The next prime is 10023100302031. The reversal of 10023100302023 is 32020300132001.
It is a cyclic number.
It is not a de Polignac number, because 10023100302023 - 210 = 10023100300999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10023100301992 and 10023100302010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10023100302623) 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 15 ways as a sum of consecutive naturals, for example, 9159140 + ... + 10194902.
It is an arithmetic number, because the mean of its divisors is an integer number (643955194080).
Almost surely, 210023100302023 is an apocalyptic number.
10023100302023 is a deficient number, since it is larger than the sum of its proper divisors (280182803257).
10023100302023 is a wasteful number, since it uses less digits than its factorization.
10023100302023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1036838.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 10023100302023 its reverse (32020300132001), we get a palindrome (42043400434024).
The spelling of 10023100302023 in words is "ten trillion, twenty-three billion, one hundred million, three hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •