Base | Representation |
---|---|
bin | 10001101000111101011… |
… | …010000001101001110001 |
3 | 11021212221001212200212001 |
4 | 101220331122001221301 |
5 | 124330102004311121 |
6 | 2324514304534001 |
7 | 153402501401524 |
oct | 21507532015161 |
9 | 4255831780761 |
10 | 1212211010161 |
11 | 428106570828 |
12 | 176b27021301 |
13 | 8a4073900c8 |
14 | 42958192bbb |
15 | 217ebc3c991 |
hex | 11a3d681a71 |
1212211010161 has 2 divisors, whose sum is σ = 1212211010162. Its totient is φ = 1212211010160.
The previous prime is 1212211010149. The next prime is 1212211010173. The reversal of 1212211010161 is 1610101122121.
It is a balanced prime because it is at equal distance from previous prime (1212211010149) and next prime (1212211010173).
It can be written as a sum of positive squares in only one way, i.e., 650513223936 + 561697786225 = 806544^2 + 749465^2 .
It is a cyclic number.
It is not a de Polignac number, because 1212211010161 - 29 = 1212211009649 is a prime.
It is not a weakly prime, because it can be changed into another prime (1212211010191) 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, 606105505080 + 606105505081.
It is an arithmetic number, because the mean of its divisors is an integer number (606105505081).
Almost surely, 21212211010161 is an apocalyptic number.
It is an amenable number.
1212211010161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212211010161 is an equidigital number, since it uses as much as digits as its factorization.
1212211010161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 1212211010161 its reverse (1610101122121), we get a palindrome (2822312132282).
The spelling of 1212211010161 in words is "one trillion, two hundred twelve billion, two hundred eleven million, ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •