Base | Representation |
---|---|
bin | 1001001101001011011110… |
… | …0010000100011110010001 |
3 | 1022211122201010100202022022 |
4 | 2103102313202010132101 |
5 | 2311314400130023441 |
6 | 33305554234221225 |
7 | 2063202100232354 |
oct | 223226742043621 |
9 | 38748633322268 |
10 | 10122022111121 |
11 | 32527a8668158 |
12 | 1175870884815 |
13 | 58566c25c23b |
14 | 26dca0c4829b |
15 | 12846c6c784b |
hex | 934b7884791 |
10122022111121 has 2 divisors, whose sum is σ = 10122022111122. Its totient is φ = 10122022111120.
The previous prime is 10122022111063. The next prime is 10122022111129. The reversal of 10122022111121 is 12111122022101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10121305960000 + 716151121 = 3181400^2 + 26761^2 .
It is a cyclic number.
It is not a de Polignac number, because 10122022111121 - 26 = 10122022111057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10122022111121.
It is not a weakly prime, because it can be changed into another prime (10122022111129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061011055560 + 5061011055561.
It is an arithmetic number, because the mean of its divisors is an integer number (5061011055561).
Almost surely, 210122022111121 is an apocalyptic number.
It is an amenable number.
10122022111121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122022111121 is an equidigital number, since it uses as much as digits as its factorization.
10122022111121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10122022111121 its reverse (12111122022101), we get a palindrome (22233144133222).
The spelling of 10122022111121 in words is "ten trillion, one hundred twenty-two billion, twenty-two million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •