Base | Representation |
---|---|
bin | 1001000110001100011001… |
… | …1000010000010010010111 |
3 | 1022102011221102101010121220 |
4 | 2101203012120100102113 |
5 | 2302333110100041043 |
6 | 33134505543341423 |
7 | 2051423120123151 |
oct | 221430630202227 |
9 | 38364842333556 |
10 | 10002012112023 |
11 | 32069140a3618 |
12 | 1156559751873 |
13 | 577254c83859 |
14 | 26815845bad1 |
15 | 1252968e9483 |
hex | 918c6610497 |
10002012112023 has 16 divisors (see below), whose sum is σ = 13508406132480. Its totient is φ = 6582356901056.
The previous prime is 10002012112013. The next prime is 10002012112039. The reversal of 10002012112023 is 32021121020001.
It is a cyclic number.
It is not a de Polignac number, because 10002012112023 - 216 = 10002012046487 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10002012111993 and 10002012112011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002012112013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67903515 + ... + 68050652.
It is an arithmetic number, because the mean of its divisors is an integer number (844275383280).
Almost surely, 210002012112023 is an apocalyptic number.
10002012112023 is a deficient number, since it is larger than the sum of its proper divisors (3506394020457).
10002012112023 is a wasteful number, since it uses less digits than its factorization.
10002012112023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135954486.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10002012112023 its reverse (32021121020001), we get a palindrome (42023133132024).
The spelling of 10002012112023 in words is "ten trillion, two billion, twelve million, one hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •