Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …001001011000111101100011 |
3 | 111010002212120121011012001201 |
4 | 112233111223021120331203 |
5 | 101102031201421023021 |
6 | 552412002154542031 |
7 | 30031330533154063 |
oct | 2657255311307543 |
9 | 433085517135051 |
10 | 100010111111011 |
11 | 29959060511572 |
12 | b272767a37917 |
13 | 43a5bb3b6737a |
14 | 1a9a72da193a3 |
15 | b8675c2c9591 |
hex | 5af56b258f63 |
100010111111011 has 4 divisors (see below), whose sum is σ = 101000310231024. Its totient is φ = 99019911991000.
The previous prime is 100010111110937. The next prime is 100010111111051. The reversal of 100010111111011 is 110111111010001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100010111111011 - 27 = 100010111110883 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100010111111051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 495099559855 + ... + 495099560056.
It is an arithmetic number, because the mean of its divisors is an integer number (25250077557756).
Almost surely, 2100010111111011 is an apocalyptic number.
100010111111011 is a deficient number, since it is larger than the sum of its proper divisors (990199120013).
100010111111011 is an equidigital number, since it uses as much as digits as its factorization.
100010111111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 990199120012.
The product of its (nonzero) digits is 1, while the sum is 10.
Adding to 100010111111011 its reverse (110111111010001), we get a palindrome (210121222121012).
The spelling of 100010111111011 in words is "one hundred trillion, ten billion, one hundred eleven million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •