Base | Representation |
---|---|
bin | 10110101111010111100010… |
… | …011010100011111010010011 |
3 | 111010010001202001101000022110 |
4 | 112233113202122203322103 |
5 | 101102044301144213021 |
6 | 552412532515040403 |
7 | 30031431241251135 |
oct | 2657274232437223 |
9 | 433101661330273 |
10 | 100012112101011 |
11 | 29959997a74a10 |
12 | b273025ba0103 |
13 | 43a614259a216 |
14 | 1a9a87d691055 |
15 | b86827cd5476 |
hex | 5af5e26a3e93 |
100012112101011 has 64 divisors (see below), whose sum is σ = 148044310364160. Its totient is φ = 59552404477440.
The previous prime is 100012112101001. The next prime is 100012112101021. The reversal of 100012112101011 is 110101211210001.
It is an interprime number because it is at equal distance from previous prime (100012112101001) and next prime (100012112101021).
It is not a de Polignac number, because 100012112101011 - 213 = 100012112092819 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100012112101001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 335211046 + ... + 335509268.
It is an arithmetic number, because the mean of its divisors is an integer number (2313192349440).
Almost surely, 2100012112101011 is an apocalyptic number.
100012112101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100012112101011 is a deficient number, since it is larger than the sum of its proper divisors (48032198263149).
100012112101011 is a wasteful number, since it uses less digits than its factorization.
100012112101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299136.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 100012112101011 its reverse (110101211210001), we get a palindrome (210113323311012).
The spelling of 100012112101011 in words is "one hundred trillion, twelve billion, one hundred twelve million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •