Base | Representation |
---|---|
bin | 10000001011001101101… |
… | …000011101111011111101 |
3 | 10221021002221020202210011 |
4 | 100023031220131323331 |
5 | 121202424141000104 |
6 | 2210350102143221 |
7 | 143210165600125 |
oct | 20131550357375 |
9 | 3837087222704 |
10 | 1111551500029 |
11 | 399451930a33 |
12 | 15b514421b11 |
13 | 80a85049aa9 |
14 | 3bb296d7c85 |
15 | 1dda9b7c904 |
hex | 102cda1defd |
1111551500029 has 2 divisors, whose sum is σ = 1111551500030. Its totient is φ = 1111551500028.
The previous prime is 1111551500027. The next prime is 1111551500113. The reversal of 1111551500029 is 9200051551111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 681412277529 + 430139222500 = 825477^2 + 655850^2 .
It is an emirp because it is prime and its reverse (9200051551111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1111551500029 - 21 = 1111551500027 is a prime.
Together with 1111551500027, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111551500023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555775750014 + 555775750015.
It is an arithmetic number, because the mean of its divisors is an integer number (555775750015).
Almost surely, 21111551500029 is an apocalyptic number.
It is an amenable number.
1111551500029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111551500029 is an equidigital number, since it uses as much as digits as its factorization.
1111551500029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2250, while the sum is 31.
The spelling of 1111551500029 in words is "one trillion, one hundred eleven billion, five hundred fifty-one million, five hundred thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •