Base | Representation |
---|---|
bin | 1001000111011011010101… |
… | …1101111101010101111111 |
3 | 1022111012122021012112002010 |
4 | 2101312311131331111333 |
5 | 2303210010011343403 |
6 | 33152332422502303 |
7 | 2053103214506346 |
oct | 221666535752577 |
9 | 38435567175063 |
10 | 10023203231103 |
11 | 32148a8a12a77 |
12 | 115a692594993 |
13 | 57925136357a |
14 | 2691a8a00b5d |
15 | 125ad6ee9603 |
hex | 91db577d57f |
10023203231103 has 16 divisors (see below), whose sum is σ = 13415076147200. Its totient is φ = 6656777121600.
The previous prime is 10023203231099. The next prime is 10023203231137. The reversal of 10023203231103 is 30113230232001.
It is not a de Polignac number, because 10023203231103 - 22 = 10023203231099 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10023203231103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10023203231603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4620223 + ... + 6433728.
It is an arithmetic number, because the mean of its divisors is an integer number (838442259200).
Almost surely, 210023203231103 is an apocalyptic number.
10023203231103 is a deficient number, since it is larger than the sum of its proper divisors (3391872916097).
10023203231103 is a wasteful number, since it uses less digits than its factorization.
10023203231103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11055102.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10023203231103 its reverse (30113230232001), we get a palindrome (40136433463104).
The spelling of 10023203231103 in words is "ten trillion, twenty-three billion, two hundred three million, two hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •