Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …000110100101100000111001 |
3 | 111010002000022200001200102221 |
4 | 112233031102012211200321 |
5 | 101101404223324323001 |
6 | 552403512133124041 |
7 | 30030561335445661 |
oct | 2657152206454071 |
9 | 433060280050387 |
10 | 100001101011001 |
11 | 29955257552023 |
12 | b270a72489621 |
13 | 43a50a928bb48 |
14 | 1a9a1171351a1 |
15 | b863d12a51a1 |
hex | 5af3521a5839 |
100001101011001 has 2 divisors, whose sum is σ = 100001101011002. Its totient is φ = 100001101011000.
The previous prime is 100001101010969. The next prime is 100001101011079. The reversal of 100001101011001 is 100110101100001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86426120799225 + 13574980211776 = 9296565^2 + 3684424^2 .
It is a cyclic number.
It is not a de Polignac number, because 100001101011001 - 25 = 100001101010969 is a prime.
It is not a weakly prime, because it can be changed into another prime (100001111011001) 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 as a sum of consecutive naturals, namely, 50000550505500 + 50000550505501.
It is an arithmetic number, because the mean of its divisors is an integer number (50000550505501).
Almost surely, 2100001101011001 is an apocalyptic number.
It is an amenable number.
100001101011001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001101011001 is an equidigital number, since it uses as much as digits as its factorization.
100001101011001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100001101011001 its reverse (100110101100001), we get a palindrome (200111202111002).
The spelling of 100001101011001 in words is "one hundred trillion, one billion, one hundred one million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •