Base | Representation |
---|---|
bin | 10110110000111100000111… |
… | …100110001111001000010011 |
3 | 111010111101111121122211222101 |
4 | 112300330013212033020103 |
5 | 101110331441141213021 |
6 | 552534313231021231 |
7 | 30042303443146660 |
oct | 2660740746171023 |
9 | 433441447584871 |
10 | 100120110101011 |
11 | 299a0778031870 |
12 | b28bb4636a817 |
13 | 43b339409c630 |
14 | 1aa1ba6a18a67 |
15 | b89549272a91 |
hex | 5b0f0798f213 |
100120110101011 has 32 divisors (see below), whose sum is σ = 134429891194368. Its totient is φ = 72012916477440.
The previous prime is 100120110100987. The next prime is 100120110101071. The reversal of 100120110101011 is 110101011021001.
It is a cyclic number.
It is not a de Polignac number, because 100120110101011 - 211 = 100120110098963 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100120110101071) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 46559115 + ... + 48662011.
It is an arithmetic number, because the mean of its divisors is an integer number (4200934099824).
Almost surely, 2100120110101011 is an apocalyptic number.
100120110101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100120110101011 is a deficient number, since it is larger than the sum of its proper divisors (34309781093357).
100120110101011 is a wasteful number, since it uses less digits than its factorization.
100120110101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2150491.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 100120110101011 its reverse (110101011021001), we get a palindrome (210221121122012).
The spelling of 100120110101011 in words is "one hundred trillion, one hundred twenty billion, one hundred ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •