Base | Representation |
---|---|
bin | 101110100111010111… |
… | …0010001010001000001 |
3 | 100120101111012220011122 |
4 | 1131032232101101001 |
5 | 3120003340000001 |
6 | 113553153322025 |
7 | 10142460313646 |
oct | 1351656212101 |
9 | 316344186148 |
10 | 100105000001 |
11 | 394aa732166 |
12 | 17498b66315 |
13 | 95944b4016 |
14 | 4bb8d93dcd |
15 | 290d57ab1b |
hex | 174eb91441 |
100105000001 has 2 divisors, whose sum is σ = 100105000002. Its totient is φ = 100105000000.
The previous prime is 100104999983. The next prime is 100105000013. The reversal of 100105000001 is 100000501001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63976114225 + 36128885776 = 252935^2 + 190076^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100105000001 is a prime.
It is a super-2 number, since 2×1001050000012 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100105000301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50052500000 + 50052500001.
It is an arithmetic number, because the mean of its divisors is an integer number (50052500001).
Almost surely, 2100105000001 is an apocalyptic number.
It is an amenable number.
100105000001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100105000001 is an equidigital number, since it uses as much as digits as its factorization.
100105000001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 8.
Adding to 100105000001 its reverse (100000501001), we get a palindrome (200105501002).
The spelling of 100105000001 in words is "one hundred billion, one hundred five million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •