Base | Representation |
---|---|
bin | 1001001100100110100101… |
… | …1100001110010010011101 |
3 | 1022210201011011121001210121 |
4 | 2103021221130032102131 |
5 | 2311134111214133041 |
6 | 33301240021034541 |
7 | 2062401544656046 |
oct | 223115134162235 |
9 | 38721134531717 |
10 | 10112122021021 |
11 | 3249588292a09 |
12 | 1173969255a51 |
13 | 584752183567 |
14 | 26d6020918cd |
15 | 12808d4a27d1 |
hex | 9326970e49d |
10112122021021 has 2 divisors, whose sum is σ = 10112122021022. Its totient is φ = 10112122021020.
The previous prime is 10112122020907. The next prime is 10112122021051. The reversal of 10112122021021 is 12012022121101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6772954200100 + 3339167820921 = 2602490^2 + 1827339^2 .
It is a cyclic number.
It is not a de Polignac number, because 10112122021021 - 215 = 10112121988253 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10112122020986 and 10112122021004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10112122021051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056061010510 + 5056061010511.
It is an arithmetic number, because the mean of its divisors is an integer number (5056061010511).
Almost surely, 210112122021021 is an apocalyptic number.
It is an amenable number.
10112122021021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112122021021 is an equidigital number, since it uses as much as digits as its factorization.
10112122021021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10112122021021 its reverse (12012022121101), we get a palindrome (22124144142122).
The spelling of 10112122021021 in words is "ten trillion, one hundred twelve billion, one hundred twenty-two million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •