Base | Representation |
---|---|
bin | 1001100110101111000001… |
… | …00001001110010001110001 |
3 | 2202210020212221002111201121 |
4 | 10303113200201032101301 |
5 | 10232031100434000144 |
6 | 112531211325302241 |
7 | 4310010564112636 |
oct | 463274041162161 |
9 | 82706787074647 |
10 | 21122121000049 |
11 | 6803928719853 |
12 | 2451737704981 |
13 | ba2a65cc8144 |
14 | 53045d5a218d |
15 | 26967c8b7384 |
hex | 1335e084e471 |
21122121000049 has 2 divisors, whose sum is σ = 21122121000050. Its totient is φ = 21122121000048.
The previous prime is 21122121000023. The next prime is 21122121000067. The reversal of 21122121000049 is 94000012122112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14184691790049 + 6937429210000 = 3766257^2 + 2633900^2 .
It is a cyclic number.
It is not a de Polignac number, because 21122121000049 - 217 = 21122120868977 is a prime.
It is a super-2 number, since 2×211221210000492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21122120999987 and 21122121000032.
It is not a weakly prime, because it can be changed into another prime (21122121000349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10561060500024 + 10561060500025.
It is an arithmetic number, because the mean of its divisors is an integer number (10561060500025).
Almost surely, 221122121000049 is an apocalyptic number.
It is an amenable number.
21122121000049 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122121000049 is an equidigital number, since it uses as much as digits as its factorization.
21122121000049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 21122121000049 in words is "twenty-one trillion, one hundred twenty-two billion, one hundred twenty-one million, forty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •