Base | Representation |
---|---|
bin | 100001000111000… |
… | …1011101010001101 |
3 | 2212102120100201202 |
4 | 1002032023222031 |
5 | 4233404422104 |
6 | 302124515245 |
7 | 36350314646 |
oct | 10216135215 |
9 | 2772510652 |
10 | 1111014029 |
11 | 520158314 |
12 | 2700abb25 |
13 | 149238c68 |
14 | a77a86cd |
15 | 6780e51e |
hex | 4238ba8d |
1111014029 has 2 divisors, whose sum is σ = 1111014030. Its totient is φ = 1111014028.
The previous prime is 1111014017. The next prime is 1111014049. The reversal of 1111014029 is 9204101111.
It is an a-pointer prime, because the next prime (1111014049) can be obtained adding 1111014029 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 572309929 + 538704100 = 23923^2 + 23210^2 .
It is a cyclic number.
It is not a de Polignac number, because 1111014029 - 28 = 1111013773 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1111014029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111014049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555507014 + 555507015.
It is an arithmetic number, because the mean of its divisors is an integer number (555507015).
Almost surely, 21111014029 is an apocalyptic number.
It is an amenable number.
1111014029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111014029 is an equidigital number, since it uses as much as digits as its factorization.
1111014029 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 square root of 1111014029 is about 33331.8770698561. The cubic root of 1111014029 is about 1035.7140021035.
The spelling of 1111014029 in words is "one billion, one hundred eleven million, fourteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •