Base | Representation |
---|---|
bin | 10110101111010110100111… |
… | …010010000000010001000000 |
3 | 111010002222011220120011110210 |
4 | 112233112213102000101000 |
5 | 101102040233210031422 |
6 | 552412250234554120 |
7 | 30031364533455414 |
oct | 2657264722002100 |
9 | 433088156504423 |
10 | 100011120002112 |
11 | 29959528a58370 |
12 | b2729a9898940 |
13 | 43a6014b98457 |
14 | 1a9a7c79dcd44 |
15 | b867bab6510c |
hex | 5af5a7480440 |
100011120002112 has 112 divisors (see below), whose sum is σ = 288704542857984. Its totient is φ = 30302611776000.
The previous prime is 100011120002111. The next prime is 100011120002119. The reversal of 100011120002112 is 211200021110001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (100011120002111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13963687 + ... + 19874777.
Almost surely, 2100011120002112 is an apocalyptic number.
100011120002112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100011120002112 is an abundant number, since it is smaller than the sum of its proper divisors (188693422855872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100011120002112 is a wasteful number, since it uses less digits than its factorization.
100011120002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5919128 (or 5919118 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100011120002112 its reverse (211200021110001), we get a palindrome (311211141112113).
The spelling of 100011120002112 in words is "one hundred trillion, eleven billion, one hundred twenty million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •