Base | Representation |
---|---|
bin | 1001000110110010011110… |
… | …0011010011001101011001 |
3 | 1022110011022200112002221012 |
4 | 2101230213203103031121 |
5 | 2303020022434111441 |
6 | 33143320034223305 |
7 | 2052234310426205 |
oct | 221544743231531 |
9 | 38404280462835 |
10 | 10012232332121 |
11 | 3210189151208 |
12 | 1158530424b35 |
13 | 5781c3487976 |
14 | 268847947b05 |
15 | 125693ca79eb |
hex | 91b278d3359 |
10012232332121 has 2 divisors, whose sum is σ = 10012232332122. Its totient is φ = 10012232332120.
The previous prime is 10012232332097. The next prime is 10012232332153. The reversal of 10012232332121 is 12123323221001.
10012232332121 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., 9429880197721 + 582352134400 = 3070811^2 + 763120^2 .
It is a cyclic number.
It is not a de Polignac number, because 10012232332121 - 214 = 10012232315737 is a prime.
It is not a weakly prime, because it can be changed into another prime (10012232332171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5006116166060 + 5006116166061.
It is an arithmetic number, because the mean of its divisors is an integer number (5006116166061).
Almost surely, 210012232332121 is an apocalyptic number.
It is an amenable number.
10012232332121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10012232332121 is an equidigital number, since it uses as much as digits as its factorization.
10012232332121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10012232332121 its reverse (12123323221001), we get a palindrome (22135555553122).
The spelling of 10012232332121 in words is "ten trillion, twelve billion, two hundred thirty-two million, three hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •