Base | Representation |
---|---|
bin | 101111100101110101… |
… | …0101011110111111101 |
3 | 100202210120121112000101 |
4 | 1133023222223313331 |
5 | 3133302002244123 |
6 | 114541154401101 |
7 | 10245432654256 |
oct | 1371352536775 |
9 | 322716545011 |
10 | 102201212413 |
11 | 3a385a13613 |
12 | 17982b90191 |
13 | 9839876bb1 |
14 | 4d37535b2d |
15 | 29d25e5aad |
hex | 17cbaabdfd |
102201212413 has 2 divisors, whose sum is σ = 102201212414. Its totient is φ = 102201212412.
The previous prime is 102201212341. The next prime is 102201212483. The reversal of 102201212413 is 314212102201.
Together with previous prime (102201212341) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93148260804 + 9052951609 = 305202^2 + 95147^2 .
It is an emirp because it is prime and its reverse (314212102201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102201212413 - 29 = 102201211901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102201212483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51100606206 + 51100606207.
It is an arithmetic number, because the mean of its divisors is an integer number (51100606207).
Almost surely, 2102201212413 is an apocalyptic number.
It is an amenable number.
102201212413 is a deficient number, since it is larger than the sum of its proper divisors (1).
102201212413 is an equidigital number, since it uses as much as digits as its factorization.
102201212413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 102201212413 its reverse (314212102201), we get a palindrome (416413314614).
The spelling of 102201212413 in words is "one hundred two billion, two hundred one million, two hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •