Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …0100111001010101111101 |
3 | 1022210121020222201201112122 |
4 | 2103020212210321111331 |
5 | 2311124312024033203 |
6 | 33300532425012325 |
7 | 2062332003556154 |
oct | 223104644712575 |
9 | 38717228651478 |
10 | 10111000221053 |
11 | 3249062038aa6 |
12 | 11736b56240a5 |
13 | 58460393c0b4 |
14 | 26d5370ba59b |
15 | 128024c62538 |
hex | 9322693957d |
10111000221053 has 2 divisors, whose sum is σ = 10111000221054. Its totient is φ = 10111000221052.
The previous prime is 10111000220987. The next prime is 10111000221071. The reversal of 10111000221053 is 35012200011101.
10111000221053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10080136055929 + 30864165124 = 3174923^2 + 175682^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111000221053 - 212 = 10111000216957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111000220053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055500110526 + 5055500110527.
It is an arithmetic number, because the mean of its divisors is an integer number (5055500110527).
Almost surely, 210111000221053 is an apocalyptic number.
It is an amenable number.
10111000221053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111000221053 is an equidigital number, since it uses as much as digits as its factorization.
10111000221053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 10111000221053 its reverse (35012200011101), we get a palindrome (45123200232154).
The spelling of 10111000221053 in words is "ten trillion, one hundred eleven billion, two hundred twenty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •