Base | Representation |
---|---|
bin | 10000110011010000101… |
… | …011111111111000100001 |
3 | 11002101002202002100110022 |
4 | 100303100223333320201 |
5 | 122404010410230423 |
6 | 2242221041243225 |
7 | 146261612506205 |
oct | 20632053777041 |
9 | 4071082070408 |
10 | 1154552430113 |
11 | 405708825185 |
12 | 167915333515 |
13 | 84b48a4b014 |
14 | 3dc48670b05 |
15 | 20074d3ddc8 |
hex | 10cd0affe21 |
1154552430113 has 2 divisors, whose sum is σ = 1154552430114. Its totient is φ = 1154552430112.
The previous prime is 1154552430077. The next prime is 1154552430131. The reversal of 1154552430113 is 3110342554511.
It is a happy number.
Together with next prime (1154552430131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 797507939089 + 357044491024 = 893033^2 + 597532^2 .
It is a cyclic number.
It is not a de Polignac number, because 1154552430113 - 210 = 1154552429089 is a prime.
It is not a weakly prime, because it can be changed into another prime (1154552430173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 577276215056 + 577276215057.
It is an arithmetic number, because the mean of its divisors is an integer number (577276215057).
Almost surely, 21154552430113 is an apocalyptic number.
It is an amenable number.
1154552430113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1154552430113 is an equidigital number, since it uses as much as digits as its factorization.
1154552430113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 1154552430113 its reverse (3110342554511), we get a palindrome (4264894984624).
The spelling of 1154552430113 in words is "one trillion, one hundred fifty-four billion, five hundred fifty-two million, four hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •