Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …101001010011000011000001 |
3 | 111010002000100022011222110202 |
4 | 112233031102221103003001 |
5 | 101101404233142013101 |
6 | 552403513100134545 |
7 | 30030561506004563 |
oct | 2657152251230301 |
9 | 433060308158422 |
10 | 100001110110401 |
11 | 299552616a7595 |
12 | b270a75537455 |
13 | 43a50ab1267c6 |
14 | 1a9a118423333 |
15 | b863d1ea136b |
hex | 5af352a530c1 |
100001110110401 has 2 divisors, whose sum is σ = 100001110110402. Its totient is φ = 100001110110400.
The previous prime is 100001110110383. The next prime is 100001110110403. The reversal of 100001110110401 is 104011011100001.
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., 95591215109776 + 4409895000625 = 9777076^2 + 2099975^2 .
It is a cyclic number.
It is not a de Polignac number, because 100001110110401 - 226 = 100001043001537 is a prime.
Together with 100001110110403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (100001110110403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000555055200 + 50000555055201.
It is an arithmetic number, because the mean of its divisors is an integer number (50000555055201).
Almost surely, 2100001110110401 is an apocalyptic number.
It is an amenable number.
100001110110401 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001110110401 is an equidigital number, since it uses as much as digits as its factorization.
100001110110401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100001110110401 its reverse (104011011100001), we get a palindrome (204012121210402).
The spelling of 100001110110401 in words is "one hundred trillion, one billion, one hundred ten million, one hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •