Base | Representation |
---|---|
bin | 10000000000011110011… |
… | …100001001001111001001 |
3 | 10220011100110001211220222 |
4 | 100000132130021033021 |
5 | 121010321203301441 |
6 | 2201202051555425 |
7 | 142321402314422 |
oct | 20003634111711 |
9 | 3804313054828 |
10 | 1100022322121 |
11 | 394575a17a28 |
12 | 1592372bbb75 |
13 | 7c9685c2628 |
14 | 3b354438649 |
15 | 1d93290ed4b |
hex | 1001e7093c9 |
1100022322121 has 2 divisors, whose sum is σ = 1100022322122. Its totient is φ = 1100022322120.
The previous prime is 1100022322103. The next prime is 1100022322181. The reversal of 1100022322121 is 1212232200011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1100004513721 + 17808400 = 1048811^2 + 4220^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100022322121 - 26 = 1100022322057 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1100022322121.
It is not a weakly prime, because it can be changed into another prime (1100022322181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550011161060 + 550011161061.
It is an arithmetic number, because the mean of its divisors is an integer number (550011161061).
Almost surely, 21100022322121 is an apocalyptic number.
It is an amenable number.
1100022322121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100022322121 is an equidigital number, since it uses as much as digits as its factorization.
1100022322121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1100022322121 its reverse (1212232200011), we get a palindrome (2312254522132).
The spelling of 1100022322121 in words is "one trillion, one hundred billion, twenty-two million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •