Base | Representation |
---|---|
bin | 10110101111010111100010… |
… | …010110011100010010010000 |
3 | 111010010001201222100011002110 |
4 | 112233113202112130102100 |
5 | 101102044300410134300 |
6 | 552412532435545320 |
7 | 30031431226133040 |
oct | 2657274226342220 |
9 | 433101658304073 |
10 | 100012111021200 |
11 | 299599973a7704 |
12 | b27302575b240 |
13 | 43a61422ac891 |
14 | 1a9a87d48d720 |
15 | b86827b70550 |
hex | 5af5e259c490 |
100012111021200 has 240 divisors, whose sum is σ = 376035241351040. Its totient is φ = 22242075586560.
The previous prime is 100012111021177. The next prime is 100012111021267. The reversal of 100012111021200 is 2120111210001.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (12).
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 47 ways as a sum of consecutive naturals, for example, 160583845 + ... + 161205444.
Almost surely, 2100012111021200 is an apocalyptic number.
100012111021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100012111021200 is an abundant number, since it is smaller than the sum of its proper divisors (276023130329840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100012111021200 is a wasteful number, since it uses less digits than its factorization.
100012111021200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321789354 (or 321789343 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100012111021200 its reverse (2120111210001), we get a palindrome (102132222231201).
The spelling of 100012111021200 in words is "one hundred trillion, twelve billion, one hundred eleven million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •