Base | Representation |
---|---|
bin | 10000001010111001010… |
… | …001110010100110010101 |
3 | 10221020020010200022221102 |
4 | 100022321101302212111 |
5 | 121201224230323104 |
6 | 2210252142555445 |
7 | 143165551151306 |
oct | 20127121624625 |
9 | 3836203608842 |
10 | 1111210011029 |
11 | 39929709a218 |
12 | 15b439b98b85 |
13 | 80a2c3837b1 |
14 | 3bad62047ad |
15 | 1dd89bc5a1e |
hex | 102b9472995 |
1111210011029 has 2 divisors, whose sum is σ = 1111210011030. Its totient is φ = 1111210011028.
The previous prime is 1111210011001. The next prime is 1111210011061. The reversal of 1111210011029 is 9201100121111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 894405232900 + 216804778129 = 945730^2 + 465623^2 .
It is a cyclic number.
It is not a de Polignac number, because 1111210011029 - 28 = 1111210010773 is a prime.
It is a super-2 number, since 2×11112100110292 (a number of 25 digits) contains 22 as substring.
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 1111210011029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111210016029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555605005514 + 555605005515.
It is an arithmetic number, because the mean of its divisors is an integer number (555605005515).
Almost surely, 21111210011029 is an apocalyptic number.
It is an amenable number.
1111210011029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111210011029 is an equidigital number, since it uses as much as digits as its factorization.
1111210011029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 1111210011029 in words is "one trillion, one hundred eleven billion, two hundred ten million, eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •