Base | Representation |
---|---|
bin | 1100010110111010101… |
… | …0110101101000110101 |
3 | 202022000020221121220022 |
4 | 3011232222311220311 |
5 | 11434302342333023 |
6 | 241311154414525 |
7 | 21224146152434 |
oct | 3055652655065 |
9 | 668006847808 |
10 | 212310121013 |
11 | 8204958a331 |
12 | 35192291445 |
13 | 170367b6453 |
14 | a3c0d8911b |
15 | 57c90527c8 |
hex | 316eab5a35 |
212310121013 has 2 divisors, whose sum is σ = 212310121014. Its totient is φ = 212310121012.
The previous prime is 212310120991. The next prime is 212310121139. The reversal of 212310121013 is 310121013212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 146170111684 + 66140009329 = 382322^2 + 257177^2 .
It is a cyclic number.
It is not a de Polignac number, because 212310121013 - 212 = 212310116917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212310120982 and 212310121000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212310123013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106155060506 + 106155060507.
It is an arithmetic number, because the mean of its divisors is an integer number (106155060507).
Almost surely, 2212310121013 is an apocalyptic number.
It is an amenable number.
212310121013 is a deficient number, since it is larger than the sum of its proper divisors (1).
212310121013 is an equidigital number, since it uses as much as digits as its factorization.
212310121013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 212310121013 its reverse (310121013212), we get a palindrome (522431134225).
It can be divided in two parts, 212 and 310121013, that multiplied together give a palindrome (65745654756).
The spelling of 212310121013 in words is "two hundred twelve billion, three hundred ten million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •