Base | Representation |
---|---|
bin | 1100001111000110011… |
… | …1001100000000010101 |
3 | 202002121000222122111001 |
4 | 3003301213030000111 |
5 | 11421003233341203 |
6 | 240323044543301 |
7 | 21121151422621 |
oct | 3036147140025 |
9 | 662530878431 |
10 | 210212012053 |
11 | 81172222a8a |
12 | 348a76b1b31 |
13 | 16a90c0b264 |
14 | a262472181 |
15 | 5704c6091d |
hex | 30f19cc015 |
210212012053 has 2 divisors, whose sum is σ = 210212012054. Its totient is φ = 210212012052.
The previous prime is 210212011979. The next prime is 210212012069. The reversal of 210212012053 is 350210212012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 198339294609 + 11872717444 = 445353^2 + 108962^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210212012053 is a prime.
It is a super-2 number, since 2×2102120120532 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 210212012053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210212012753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105106006026 + 105106006027.
It is an arithmetic number, because the mean of its divisors is an integer number (105106006027).
Almost surely, 2210212012053 is an apocalyptic number.
It is an amenable number.
210212012053 is a deficient number, since it is larger than the sum of its proper divisors (1).
210212012053 is an equidigital number, since it uses as much as digits as its factorization.
210212012053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 240, while the sum is 19.
Adding to 210212012053 its reverse (350210212012), we get a palindrome (560422224065).
The spelling of 210212012053 in words is "two hundred ten billion, two hundred twelve million, twelve thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •