Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …010100000111111101110001 |
3 | 111010110112000120011121121002 |
4 | 112300303221110013331301 |
5 | 101110204323044231001 |
6 | 552530210345211345 |
7 | 30041532130346345 |
oct | 2660635124077561 |
9 | 433415016147532 |
10 | 100111012102001 |
11 | 2999792949651a |
12 | b28a227490b55 |
13 | 43b2574229574 |
14 | 1aa15825b3625 |
15 | b891b568946b |
hex | 5b0ce9507f71 |
100111012102001 has 12 divisors (see below), whose sum is σ = 104679630356532. Its totient is φ = 95733910558176.
The previous prime is 100111012101953. The next prime is 100111012102007. The reversal of 100111012102001 is 100201210111001.
It can be written as a sum of positive squares in 2 ways, for example, as 48346656486976 + 51764355615025 = 6953176^2 + 7194745^2 .
It is not a de Polignac number, because 100111012102001 - 26 = 100111012101937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100111012102007) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22084886 + ... + 26229071.
It is an arithmetic number, because the mean of its divisors is an integer number (8723302529711).
Almost surely, 2100111012102001 is an apocalyptic number.
It is an amenable number.
100111012102001 is a deficient number, since it is larger than the sum of its proper divisors (4568618254531).
100111012102001 is an equidigital number, since it uses as much as digits as its factorization.
100111012102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48317920 (or 48317897 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100111012102001 its reverse (100201210111001), we get a palindrome (200312222213002).
The spelling of 100111012102001 in words is "one hundred trillion, one hundred eleven billion, twelve million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •