Base | Representation |
---|---|
bin | 1011000110110110000001… |
… | …1111111100101010000001 |
3 | 1121020110211222112101012001 |
4 | 2301231200133330222001 |
5 | 3100041102004311202 |
6 | 41550113504304001 |
7 | 2400205654565203 |
oct | 261554037745201 |
9 | 47213758471161 |
10 | 12212211010177 |
11 | 398919581a752 |
12 | 1452984912001 |
13 | 6a77b67b4169 |
14 | 303107728773 |
15 | 162a033e6d87 |
hex | b1b607fca81 |
12212211010177 has 2 divisors, whose sum is σ = 12212211010178. Its totient is φ = 12212211010176.
The previous prime is 12212211010141. The next prime is 12212211010229. The reversal of 12212211010177 is 77101011221221.
12212211010177 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., 9974580961536 + 2237630048641 = 3158256^2 + 1495871^2 .
It is a cyclic number.
It is not a de Polignac number, because 12212211010177 - 235 = 12177851271809 is a prime.
It is not a weakly prime, because it can be changed into another prime (12212211010477) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106105505088 + 6106105505089.
It is an arithmetic number, because the mean of its divisors is an integer number (6106105505089).
Almost surely, 212212211010177 is an apocalyptic number.
It is an amenable number.
12212211010177 is a deficient number, since it is larger than the sum of its proper divisors (1).
12212211010177 is an equidigital number, since it uses as much as digits as its factorization.
12212211010177 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 784, while the sum is 28.
Adding to 12212211010177 its reverse (77101011221221), we get a palindrome (89313222231398).
The spelling of 12212211010177 in words is "twelve trillion, two hundred twelve billion, two hundred eleven million, ten thousand, one hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •