Base | Representation |
---|---|
bin | 110011101111000010… |
… | …1101101001011100001 |
3 | 101121202202122221122202 |
4 | 1213132011231023201 |
5 | 3310013124021004 |
6 | 123012211142545 |
7 | 11012111201213 |
oct | 1473605551341 |
9 | 347682587582 |
10 | 111100220129 |
11 | 431321a5848 |
12 | 196472a4a55 |
13 | a627426b32 |
14 | 553d37c5b3 |
15 | 2d539c3b1e |
hex | 19de16d2e1 |
111100220129 has 2 divisors, whose sum is σ = 111100220130. Its totient is φ = 111100220128.
The previous prime is 111100220047. The next prime is 111100220149. The reversal of 111100220129 is 921022001111.
It is an a-pointer prime, because the next prime (111100220149) can be obtained adding 111100220129 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62580025600 + 48520194529 = 250160^2 + 220273^2 .
It is an emirp because it is prime and its reverse (921022001111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111100220129 - 28 = 111100219873 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111100220129.
It is not a weakly prime, because it can be changed into another prime (111100220149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550110064 + 55550110065.
It is an arithmetic number, because the mean of its divisors is an integer number (55550110065).
Almost surely, 2111100220129 is an apocalyptic number.
It is an amenable number.
111100220129 is a deficient number, since it is larger than the sum of its proper divisors (1).
111100220129 is an equidigital number, since it uses as much as digits as its factorization.
111100220129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 111100220129 in words is "one hundred eleven billion, one hundred million, two hundred twenty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •