Base | Representation |
---|---|
bin | 10111001111010110101011… |
… | …111010100111010000110001 |
3 | 111101220012110001002021100211 |
4 | 113033112223322213100301 |
5 | 101344103013034341032 |
6 | 1001214421033344121 |
7 | 30346305362566216 |
oct | 2717265372472061 |
9 | 441805401067324 |
10 | 102210221012017 |
11 | 2a627125167828 |
12 | b569038268041 |
13 | 45054c8419b91 |
14 | 1b35002dd7b0d |
15 | bc3ac81d9747 |
hex | 5cf5abea7431 |
102210221012017 has 2 divisors, whose sum is σ = 102210221012018. Its totient is φ = 102210221012016.
The previous prime is 102210221011981. The next prime is 102210221012033. The reversal of 102210221012017 is 710210122012201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96684919456801 + 5525301555216 = 9832849^2 + 2350596^2 .
It is a cyclic number.
It is not a de Polignac number, because 102210221012017 - 219 = 102210220487729 is a prime.
It is a super-2 number, since 2×1022102210120172 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102210221022017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51105110506008 + 51105110506009.
It is an arithmetic number, because the mean of its divisors is an integer number (51105110506009).
Almost surely, 2102210221012017 is an apocalyptic number.
It is an amenable number.
102210221012017 is a deficient number, since it is larger than the sum of its proper divisors (1).
102210221012017 is an equidigital number, since it uses as much as digits as its factorization.
102210221012017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 102210221012017 its reverse (710210122012201), we get a palindrome (812420343024218).
The spelling of 102210221012017 in words is "one hundred two trillion, two hundred ten billion, two hundred twenty-one million, twelve thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •