Base | Representation |
---|---|
bin | 11101001000100010111… |
… | …01000011111110101101 |
3 | 10112200210211010112000222 |
4 | 32210101131003332231 |
5 | 112400042133223432 |
6 | 2043510133101125 |
7 | 132215133255323 |
oct | 16442135037655 |
9 | 3480724115028 |
10 | 1001020211117 |
11 | 3565918a3683 |
12 | 1420077877a5 |
13 | 7351b761264 |
14 | 36641b35d13 |
15 | 1b08b0db112 |
hex | e911743fad |
1001020211117 has 2 divisors, whose sum is σ = 1001020211118. Its totient is φ = 1001020211116.
The previous prime is 1001020211101. The next prime is 1001020211119. The reversal of 1001020211117 is 7111120201001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 726618151561 + 274402059556 = 852419^2 + 523834^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001020211117 - 24 = 1001020211101 is a prime.
Together with 1001020211119, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1001020211095 and 1001020211104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001020211119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500510105558 + 500510105559.
It is an arithmetic number, because the mean of its divisors is an integer number (500510105559).
Almost surely, 21001020211117 is an apocalyptic number.
It is an amenable number.
1001020211117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001020211117 is an equidigital number, since it uses as much as digits as its factorization.
1001020211117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 1001020211117 its reverse (7111120201001), we get a palindrome (8112140412118).
The spelling of 1001020211117 in words is "one trillion, one billion, twenty million, two hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •