Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …000100101101101011010111 |
3 | 111010001220111122010122020020 |
4 | 112233030101010231223113 |
5 | 101101400010030013421 |
6 | 552403212001040223 |
7 | 30030522320145063 |
oct | 2657142104555327 |
9 | 433056448118206 |
10 | 100000010001111 |
11 | 29954847718160 |
12 | b270809026073 |
13 | 43a4c6423816c |
14 | 1a9a052296aa3 |
15 | b8636a5e7dc6 |
hex | 5af31112dad7 |
100000010001111 has 16 divisors (see below), whose sum is σ = 149385764327808. Its totient is φ = 58968064864800.
The previous prime is 100000010001103. The next prime is 100000010001139. The reversal of 100000010001111 is 111100010000001.
It is not a de Polignac number, because 100000010001111 - 23 = 100000010001103 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100000010001111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000010008111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40950043825 + ... + 40950046266.
It is an arithmetic number, because the mean of its divisors is an integer number (9336610270488).
Almost surely, 2100000010001111 is an apocalyptic number.
100000010001111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100000010001111 is a deficient number, since it is larger than the sum of its proper divisors (49385754326697).
100000010001111 is a wasteful number, since it uses less digits than its factorization.
100000010001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81900090142.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 100000010001111 its reverse (111100010000001), we get a palindrome (211100020001112).
The spelling of 100000010001111 in words is "one hundred trillion, ten million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •