Base | Representation |
---|---|
bin | 1100010101110101110… |
… | …0001110011000110001 |
3 | 202021021010001200210222 |
4 | 3011131130032120301 |
5 | 11433204343440203 |
6 | 241222351302425 |
7 | 21214036265225 |
oct | 3053534163061 |
9 | 667233050728 |
10 | 212021077553 |
11 | 81a1040973a |
12 | 3511151aa15 |
13 | 16cbb95370c |
14 | a394828785 |
15 | 57ad9aa038 |
hex | 315d70e631 |
212021077553 has 2 divisors, whose sum is σ = 212021077554. Its totient is φ = 212021077552.
The previous prime is 212021077529. The next prime is 212021077591. The reversal of 212021077553 is 355770120212.
212021077553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 164371863184 + 47649214369 = 405428^2 + 218287^2 .
It is a cyclic number.
It is not a de Polignac number, because 212021077553 - 212 = 212021073457 is a prime.
It is not a weakly prime, because it can be changed into another prime (212021077523) 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, 106010538776 + 106010538777.
It is an arithmetic number, because the mean of its divisors is an integer number (106010538777).
Almost surely, 2212021077553 is an apocalyptic number.
It is an amenable number.
212021077553 is a deficient number, since it is larger than the sum of its proper divisors (1).
212021077553 is an equidigital number, since it uses as much as digits as its factorization.
212021077553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29400, while the sum is 35.
Adding to 212021077553 its reverse (355770120212), we get a palindrome (567791197765).
The spelling of 212021077553 in words is "two hundred twelve billion, twenty-one million, seventy-seven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •