Base | Representation |
---|---|
bin | 11101001010110000110… |
… | …00100101101111011001 |
3 | 10112210212202100021201201 |
4 | 32211120120211233121 |
5 | 112410011304033032 |
6 | 2044224203114201 |
7 | 132256463215045 |
oct | 16453030455731 |
9 | 3483782307651 |
10 | 1002210221017 |
11 | 3570425a6735 |
12 | 14229a212961 |
13 | 7367b168525 |
14 | 36715bc5025 |
15 | 1b10a8018e7 |
hex | e958625bd9 |
1002210221017 has 2 divisors, whose sum is σ = 1002210221018. Its totient is φ = 1002210221016.
The previous prime is 1002210220997. The next prime is 1002210221069. The reversal of 1002210221017 is 7101220122001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 725803467481 + 276406753536 = 851941^2 + 525744^2 .
It is a cyclic number.
It is not a de Polignac number, because 1002210221017 - 223 = 1002201832409 is a prime.
It is a super-2 number, since 2×10022102210172 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1002210220985 and 1002210221003.
It is not a weakly prime, because it can be changed into another prime (1002210227017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501105110508 + 501105110509.
It is an arithmetic number, because the mean of its divisors is an integer number (501105110509).
Almost surely, 21002210221017 is an apocalyptic number.
It is an amenable number.
1002210221017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002210221017 is an equidigital number, since it uses as much as digits as its factorization.
1002210221017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 19.
Adding to 1002210221017 its reverse (7101220122001), we get a palindrome (8103430343018).
The spelling of 1002210221017 in words is "one trillion, two billion, two hundred ten million, two hundred twenty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •