Base | Representation |
---|---|
bin | 10000001101100000101… |
… | …010110111110101001001 |
3 | 10221111110212010022110211 |
4 | 100031200222313311021 |
5 | 121223002201144004 |
6 | 2211434544041121 |
7 | 143325262000243 |
oct | 20154052676511 |
9 | 3844425108424 |
10 | 1114018381129 |
11 | 39a4a8374245 |
12 | 15baa26031a1 |
13 | 81089151754 |
14 | 3bcc11a7093 |
15 | 1dea1515504 |
hex | 10360ab7d49 |
1114018381129 has 2 divisors, whose sum is σ = 1114018381130. Its totient is φ = 1114018381128.
The previous prime is 1114018381127. The next prime is 1114018381183. The reversal of 1114018381129 is 9211838104111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 607285111225 + 506733269904 = 779285^2 + 711852^2 .
It is a cyclic number.
It is not a de Polignac number, because 1114018381129 - 21 = 1114018381127 is a prime.
Together with 1114018381127, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1114018381091 and 1114018381100.
It is not a weakly prime, because it can be changed into another prime (1114018381127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557009190564 + 557009190565.
It is an arithmetic number, because the mean of its divisors is an integer number (557009190565).
Almost surely, 21114018381129 is an apocalyptic number.
It is an amenable number.
1114018381129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114018381129 is an equidigital number, since it uses as much as digits as its factorization.
1114018381129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 40.
The spelling of 1114018381129 in words is "one trillion, one hundred fourteen billion, eighteen million, three hundred eighty-one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •