Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …0100011110001101001001 |
3 | 1022210121020222112002001202 |
4 | 2103020212210132031021 |
5 | 2311124312012004042 |
6 | 33300532422353545 |
7 | 2062332002614121 |
oct | 223104644361511 |
9 | 38717228462052 |
10 | 10111000109897 |
11 | 3249061a72535 |
12 | 11736b558b8b5 |
13 | 58460390061b |
14 | 26d53708bc81 |
15 | 128024c3e632 |
hex | 9322691e349 |
10111000109897 has 2 divisors, whose sum is σ = 10111000109898. Its totient is φ = 10111000109896.
The previous prime is 10111000109869. The next prime is 10111000109981. The reversal of 10111000109897 is 79890100011101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8286274630921 + 1824725478976 = 2878589^2 + 1350824^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10111000109897 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10111000109897.
It is not a weakly prime, because it can be changed into another prime (10111000189897) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055500054948 + 5055500054949.
It is an arithmetic number, because the mean of its divisors is an integer number (5055500054949).
Almost surely, 210111000109897 is an apocalyptic number.
It is an amenable number.
10111000109897 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111000109897 is an equidigital number, since it uses as much as digits as its factorization.
10111000109897 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 38.
The spelling of 10111000109897 in words is "ten trillion, one hundred eleven billion, one hundred nine thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •