Base | Representation |
---|---|
bin | 1100010101110011011… |
… | …1000000011011110001 |
3 | 202021020102201000102212 |
4 | 3011130313000123301 |
5 | 11433144344233243 |
6 | 241221402221505 |
7 | 21213560331536 |
oct | 3053467003361 |
9 | 667212630385 |
10 | 212011321073 |
11 | 81a05955532 |
12 | 3510a1b4895 |
13 | 16cb9918956 |
14 | a393408d8d |
15 | 57acbce318 |
hex | 315cdc06f1 |
212011321073 has 2 divisors, whose sum is σ = 212011321074. Its totient is φ = 212011321072.
The previous prime is 212011321057. The next prime is 212011321127. The reversal of 212011321073 is 370123110212.
212011321073 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., 144394680049 + 67616641024 = 379993^2 + 260032^2 .
It is a cyclic number.
It is not a de Polignac number, because 212011321073 - 24 = 212011321057 is a prime.
It is not a weakly prime, because it can be changed into another prime (212011321033) 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, 106005660536 + 106005660537.
It is an arithmetic number, because the mean of its divisors is an integer number (106005660537).
Almost surely, 2212011321073 is an apocalyptic number.
It is an amenable number.
212011321073 is a deficient number, since it is larger than the sum of its proper divisors (1).
212011321073 is an equidigital number, since it uses as much as digits as its factorization.
212011321073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 212011321073 its reverse (370123110212), we get a palindrome (582134431285).
The spelling of 212011321073 in words is "two hundred twelve billion, eleven million, three hundred twenty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •