Base | Representation |
---|---|
bin | 1001000110110001101001… |
… | …1010110011001100001011 |
3 | 1022110010202022221002002200 |
4 | 2101230122122303030023 |
5 | 2303014100033000021 |
6 | 33143242123531243 |
7 | 2052225663560430 |
oct | 221543232631413 |
9 | 38403668832080 |
10 | 10012012000011 |
11 | 321008584145a |
12 | 115848a689b23 |
13 | 578189932038 |
14 | 268826591b87 |
15 | 12567e784126 |
hex | 91b1a6b330b |
10012012000011 has 12 divisors (see below), whose sum is σ = 16527765841392. Its totient is φ = 5721149714256.
The previous prime is 10012011999973. The next prime is 10012012000033. The reversal of 10012012000011 is 11000021021001.
It is a happy number.
It is not a de Polignac number, because 10012012000011 - 210 = 10012011998987 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10012011999957 and 10012012000002.
It is not an unprimeable number, because it can be changed into a prime (10012012000051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 79460412636 + ... + 79460412761.
It is an arithmetic number, because the mean of its divisors is an integer number (1377313820116).
Almost surely, 210012012000011 is an apocalyptic number.
10012012000011 is a deficient number, since it is larger than the sum of its proper divisors (6515753841381).
10012012000011 is a wasteful number, since it uses less digits than its factorization.
10012012000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158920825410 (or 158920825407 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10012012000011 its reverse (11000021021001), we get a palindrome (21012033021012).
The spelling of 10012012000011 in words is "ten trillion, twelve billion, twelve million, eleven", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •