Base | Representation |
---|---|
bin | 1001000110001100011011… |
… | …0110011001000001010000 |
3 | 1022102011221222020111111210 |
4 | 2101203012312121001100 |
5 | 2302333114110341422 |
6 | 33134510424540120 |
7 | 2051423244225402 |
oct | 221430666310120 |
9 | 38364858214453 |
10 | 10002020012112 |
11 | 32069185aa017 |
12 | 1156560321640 |
13 | 5772567bb66b |
14 | 268159516b72 |
15 | 12529745a10c |
hex | 918c6d99050 |
10002020012112 has 80 divisors (see below), whose sum is σ = 26027982763200. Its totient is φ = 3309591515136.
The previous prime is 10002020012093. The next prime is 10002020012129. The reversal of 10002020012112 is 21121002020001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
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, 11206528 + ... + 12066080.
It is an arithmetic number, because the mean of its divisors is an integer number (325349784540).
Almost surely, 210002020012112 is an apocalyptic number.
10002020012112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10002020012112 is an abundant number, since it is smaller than the sum of its proper divisors (16025962751088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10002020012112 is a wasteful number, since it uses less digits than its factorization.
10002020012112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861340 (or 861334 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10002020012112 its reverse (21121002020001), we get a palindrome (31123022032113).
The spelling of 10002020012112 in words is "ten trillion, two billion, twenty million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •