Base | Representation |
---|---|
bin | 101111101000110110… |
… | …0010110011100010101 |
3 | 100210001121211220212102 |
4 | 1133101230112130111 |
5 | 3134003342442323 |
6 | 114555205331445 |
7 | 10251101210003 |
oct | 1372154263425 |
9 | 323047756772 |
10 | 102302312213 |
11 | 3a427a96372 |
12 | 179b0a06b85 |
13 | 98547b416a |
14 | 4d46b31a73 |
15 | 29db416328 |
hex | 17d1b16715 |
102302312213 has 2 divisors, whose sum is σ = 102302312214. Its totient is φ = 102302312212.
The previous prime is 102302312179. The next prime is 102302312251. The reversal of 102302312213 is 312213203201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72726223684 + 29576088529 = 269678^2 + 171977^2 .
It is an emirp because it is prime and its reverse (312213203201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102302312213 - 28 = 102302311957 is a prime.
It is a super-2 number, since 2×1023023122132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102302312113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51151156106 + 51151156107.
It is an arithmetic number, because the mean of its divisors is an integer number (51151156107).
Almost surely, 2102302312213 is an apocalyptic number.
It is an amenable number.
102302312213 is a deficient number, since it is larger than the sum of its proper divisors (1).
102302312213 is an equidigital number, since it uses as much as digits as its factorization.
102302312213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 102302312213 its reverse (312213203201), we get a palindrome (414515515414).
The spelling of 102302312213 in words is "one hundred two billion, three hundred two million, three hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •