Base | Representation |
---|---|
bin | 11001000010001011100010… |
… | …111111101110100000000101 |
3 | 112102211112220222220111200102 |
4 | 121002023202333232200011 |
5 | 103412343322001201041 |
6 | 1030055411240453445 |
7 | 32122351263530261 |
oct | 3102134277564005 |
9 | 472745828814612 |
10 | 110101000022021 |
11 | 32099632204678 |
12 | 1042238a17a285 |
13 | 49586310280b8 |
14 | 1d28cb9b170a1 |
15 | cadea663509b |
hex | 6422e2fee805 |
110101000022021 has 2 divisors, whose sum is σ = 110101000022022. Its totient is φ = 110101000022020.
The previous prime is 110101000021933. The next prime is 110101000022087. The reversal of 110101000022021 is 120220000101011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105408516928225 + 4692483093796 = 10266865^2 + 2166214^2 .
It is a cyclic number.
It is not a de Polignac number, because 110101000022021 - 222 = 110100995827717 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110101000021993 and 110101000022011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110101000622021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050500011010 + 55050500011011.
It is an arithmetic number, because the mean of its divisors is an integer number (55050500011011).
Almost surely, 2110101000022021 is an apocalyptic number.
It is an amenable number.
110101000022021 is a deficient number, since it is larger than the sum of its proper divisors (1).
110101000022021 is an equidigital number, since it uses as much as digits as its factorization.
110101000022021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110101000022021 its reverse (120220000101011), we get a palindrome (230321000123032).
The spelling of 110101000022021 in words is "one hundred ten trillion, one hundred one billion, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •