Base | Representation |
---|---|
bin | 10000001101100000011… |
… | …000101011010010010001 |
3 | 10221111110112010222022001 |
4 | 100031200120223102101 |
5 | 121222444441024103 |
6 | 2211434253514001 |
7 | 143325203312512 |
oct | 20154030532221 |
9 | 3844415128261 |
10 | 1114013611153 |
11 | 39a4a5706513 |
12 | 15baa0aa2901 |
13 | 81088171591 |
14 | 3bcc06c4a09 |
15 | 1dea0dc201d |
hex | 1036062b491 |
1114013611153 has 2 divisors, whose sum is σ = 1114013611154. Its totient is φ = 1114013611152.
The previous prime is 1114013611127. The next prime is 1114013611189. The reversal of 1114013611153 is 3511163104111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1109550435904 + 4463175249 = 1053352^2 + 66807^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1114013611153 is a prime.
It is not a weakly prime, because it can be changed into another prime (1114013615153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557006805576 + 557006805577.
It is an arithmetic number, because the mean of its divisors is an integer number (557006805577).
Almost surely, 21114013611153 is an apocalyptic number.
It is an amenable number.
1114013611153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114013611153 is an equidigital number, since it uses as much as digits as its factorization.
1114013611153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 28.
Adding to 1114013611153 its reverse (3511163104111), we get a palindrome (4625176715264).
The spelling of 1114013611153 in words is "one trillion, one hundred fourteen billion, thirteen million, six hundred eleven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •