Base | Representation |
---|---|
bin | 110011101111000010… |
… | …1010111001011100101 |
3 | 101121202202111101001102 |
4 | 1213132011113023211 |
5 | 3310013113130041 |
6 | 123012205205445 |
7 | 11012110344416 |
oct | 1473605271345 |
9 | 347682441042 |
10 | 111100130021 |
11 | 43132144081 |
12 | 19647260885 |
13 | a6273c4b0a |
14 | 553d35780d |
15 | 2d539a709b |
hex | 19de1572e5 |
111100130021 has 2 divisors, whose sum is σ = 111100130022. Its totient is φ = 111100130020.
The previous prime is 111100129981. The next prime is 111100130023. The reversal of 111100130021 is 120031001111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57354981121 + 53745148900 = 239489^2 + 231830^2 .
It is a cyclic number.
It is not a de Polignac number, because 111100130021 - 218 = 111099867877 is a prime.
Together with 111100130023, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 111100129984 and 111100130011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111100130023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550065010 + 55550065011.
It is an arithmetic number, because the mean of its divisors is an integer number (55550065011).
Almost surely, 2111100130021 is an apocalyptic number.
It is an amenable number.
111100130021 is a deficient number, since it is larger than the sum of its proper divisors (1).
111100130021 is an equidigital number, since it uses as much as digits as its factorization.
111100130021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 111100130021 its reverse (120031001111), we get a palindrome (231131131132).
The spelling of 111100130021 in words is "one hundred eleven billion, one hundred million, one hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.488 sec. • engine limits •