Base | Representation |
---|---|
bin | 1001000001110011111… |
… | …01101000001101101001 |
3 | 1002122201002000221210112 |
4 | 10200321331220031221 |
5 | 20040302241231441 |
6 | 354301503024105 |
7 | 31261203235043 |
oct | 4407175501551 |
9 | 1078632027715 |
10 | 310210102121 |
11 | 10a617574127 |
12 | 5015489b035 |
13 | 233391cc55a |
14 | 1102b156a93 |
15 | 8108c1e4eb |
hex | 4839f68369 |
310210102121 has 2 divisors, whose sum is σ = 310210102122. Its totient is φ = 310210102120.
The previous prime is 310210102109. The next prime is 310210102183. The reversal of 310210102121 is 121201012013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 244222767721 + 65987334400 = 494189^2 + 256880^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-310210102121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 310210102096 and 310210102105.
It is not a weakly prime, because it can be changed into another prime (310210102721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155105051060 + 155105051061.
It is an arithmetic number, because the mean of its divisors is an integer number (155105051061).
Almost surely, 2310210102121 is an apocalyptic number.
It is an amenable number.
310210102121 is a deficient number, since it is larger than the sum of its proper divisors (1).
310210102121 is an equidigital number, since it uses as much as digits as its factorization.
310210102121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 310210102121 its reverse (121201012013), we get a palindrome (431411114134).
The spelling of 310210102121 in words is "three hundred ten billion, two hundred ten million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •