Base | Representation |
---|---|
bin | 1001000110110001100110… |
… | …1101011010001011101110 |
3 | 1022110010201111112112212100 |
4 | 2101230121231122023232 |
5 | 2303014034011213402 |
6 | 33143241020515530 |
7 | 2052225460461636 |
oct | 221543155321356 |
9 | 38403644475770 |
10 | 10012000101102 |
11 | 321007a05464a |
12 | 11584866abba6 |
13 | 57818732706c |
14 | 268824b756c6 |
15 | 12567d6d371c |
hex | 91b19b5a2ee |
10012000101102 has 24 divisors (see below), whose sum is σ = 21693027278520. Its totient is φ = 3337277922000.
The previous prime is 10012000101091. The next prime is 10012000101119. The reversal of 10012000101102 is 20110100021001.
It is a happy number.
It is a super-2 number, since 2×100120001011022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 3499524 + ... + 5680727.
It is an arithmetic number, because the mean of its divisors is an integer number (903876136605).
Almost surely, 210012000101102 is an apocalyptic number.
10012000101102 is an abundant number, since it is smaller than the sum of its proper divisors (11681027177418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012000101102 is a wasteful number, since it uses less digits than its factorization.
10012000101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9240848 (or 9240845 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10012000101102 its reverse (20110100021001), we get a palindrome (30122100122103).
The spelling of 10012000101102 in words is "ten trillion, twelve billion, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •