Base | Representation |
---|---|
bin | 1100010101110111111… |
… | …0101110000110000001 |
3 | 202021021202002010011022 |
4 | 3011131332232012001 |
5 | 11433214202322241 |
6 | 241223313155225 |
7 | 21214206200045 |
oct | 3053576560601 |
9 | 667252063138 |
10 | 212030120321 |
11 | 81a155256a8 |
12 | 3511455bb15 |
13 | 16cc079b676 |
14 | a395b00025 |
15 | 57ae69454b |
hex | 315dfae181 |
212030120321 has 2 divisors, whose sum is σ = 212030120322. Its totient is φ = 212030120320.
The previous prime is 212030120213. The next prime is 212030120383. The reversal of 212030120321 is 123021030212.
Together with previous prime (212030120213) 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., 106119577600 + 105910542721 = 325760^2 + 325439^2 .
It is a cyclic number.
It is not a de Polignac number, because 212030120321 - 214 = 212030103937 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 212030120321.
It is not a weakly prime, because it can be changed into another prime (212030120521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106015060160 + 106015060161.
It is an arithmetic number, because the mean of its divisors is an integer number (106015060161).
Almost surely, 2212030120321 is an apocalyptic number.
It is an amenable number.
212030120321 is a deficient number, since it is larger than the sum of its proper divisors (1).
212030120321 is an equidigital number, since it uses as much as digits as its factorization.
212030120321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 212030120321 its reverse (123021030212), we get a palindrome (335051150533).
The spelling of 212030120321 in words is "two hundred twelve billion, thirty million, one hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •