Base | Representation |
---|---|
bin | 1001001011111101100100… |
… | …1000111001001001100001 |
3 | 1022202122201210121022201222 |
4 | 2102333121020321021201 |
5 | 2310444033420200001 |
6 | 33252215242504425 |
7 | 2061531643456355 |
oct | 222773110711141 |
9 | 38678653538658 |
10 | 10101111100001 |
11 | 3244947975a89 |
12 | 11717b5805115 |
13 | 5836b8c0408c |
14 | 26cc7997b465 |
15 | 127b469a761b |
hex | 92fd9239261 |
10101111100001 has 2 divisors, whose sum is σ = 10101111100002. Its totient is φ = 10101111100000.
The previous prime is 10101111099991. The next prime is 10101111100007. The reversal of 10101111100001 is 10000111110101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7533268302400 + 2567842797601 = 2744680^2 + 1602449^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10101111100001 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10101111100007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050555550000 + 5050555550001.
It is an arithmetic number, because the mean of its divisors is an integer number (5050555550001).
Almost surely, 210101111100001 is an apocalyptic number.
It is an amenable number.
10101111100001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101111100001 is an equidigital number, since it uses as much as digits as its factorization.
10101111100001 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 8.
Adding to 10101111100001 its reverse (10000111110101), we get a palindrome (20101222210102).
It can be divided in two parts, 1010111 and 1100001, that added together give a palindrome (2110112).
The spelling of 10101111100001 in words is "ten trillion, one hundred one billion, one hundred eleven million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •