Base | Representation |
---|---|
bin | 10111001111011001011001… |
… | …010100011010010010111001 |
3 | 111101220110221210022000022202 |
4 | 113033121121110122102321 |
5 | 101344124442314424032 |
6 | 1001220021440155545 |
7 | 30346440436553126 |
oct | 2717313124322271 |
9 | 441813853260282 |
10 | 102213130233017 |
11 | 2a628388364601 |
12 | b56970a608bb5 |
13 | 4505870068a1b |
14 | 1b351db52d74d |
15 | bc3be87ead62 |
hex | 5cf65951a4b9 |
102213130233017 has 2 divisors, whose sum is σ = 102213130233018. Its totient is φ = 102213130233016.
The previous prime is 102213130232999. The next prime is 102213130233059. The reversal of 102213130233017 is 710332031312201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69576635070121 + 32636495162896 = 8341261^2 + 5712836^2 .
It is an emirp because it is prime and its reverse (710332031312201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102213130233017 - 216 = 102213130167481 is a prime.
It is not a weakly prime, because it can be changed into another prime (102213130233817) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51106565116508 + 51106565116509.
It is an arithmetic number, because the mean of its divisors is an integer number (51106565116509).
Almost surely, 2102213130233017 is an apocalyptic number.
It is an amenable number.
102213130233017 is a deficient number, since it is larger than the sum of its proper divisors (1).
102213130233017 is an equidigital number, since it uses as much as digits as its factorization.
102213130233017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 29.
Adding to 102213130233017 its reverse (710332031312201), we get a palindrome (812545161545218).
The spelling of 102213130233017 in words is "one hundred two trillion, two hundred thirteen billion, one hundred thirty million, two hundred thirty-three thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •