Base | Representation |
---|---|
bin | 11101011001010010100… |
… | …11001010000001101001 |
3 | 10120120000100101101102022 |
4 | 32230221103022001221 |
5 | 113022000102432332 |
6 | 2051554155514225 |
7 | 132653665032032 |
oct | 16545123120151 |
9 | 3516010341368 |
10 | 1010010202217 |
11 | 35a385478a95 |
12 | 1438b6458975 |
13 | 74322118913 |
14 | 36c55aa3a89 |
15 | 1b41548c212 |
hex | eb294ca069 |
1010010202217 has 2 divisors, whose sum is σ = 1010010202218. Its totient is φ = 1010010202216.
The previous prime is 1010010202213. The next prime is 1010010202241. The reversal of 1010010202217 is 7122020100101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 989330611801 + 20679590416 = 994651^2 + 143804^2 .
It is an emirp because it is prime and its reverse (7122020100101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1010010202217 - 22 = 1010010202213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010010202195 and 1010010202204.
It is not a weakly prime, because it can be changed into another prime (1010010202213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505005101108 + 505005101109.
It is an arithmetic number, because the mean of its divisors is an integer number (505005101109).
Almost surely, 21010010202217 is an apocalyptic number.
It is an amenable number.
1010010202217 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010010202217 is an equidigital number, since it uses as much as digits as its factorization.
1010010202217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 1010010202217 its reverse (7122020100101), we get a palindrome (8132030302318).
The spelling of 1010010202217 in words is "one trillion, ten billion, ten million, two hundred two thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •