Base | Representation |
---|---|
bin | 1001001111000001000001… |
… | …1000011101011001110001 |
3 | 1022221200011021110101020112 |
4 | 2103300100120131121301 |
5 | 2312324011322110324 |
6 | 33332253352351105 |
7 | 2065400055014102 |
oct | 223602030353161 |
9 | 38850137411215 |
10 | 10153577535089 |
11 | 32651208a723a |
12 | 117b9b86a5495 |
13 | 58862a950741 |
14 | 271615aa23a9 |
15 | 1291b7b47c0e |
hex | 93c1061d671 |
10153577535089 has 2 divisors, whose sum is σ = 10153577535090. Its totient is φ = 10153577535088.
The previous prime is 10153577535047. The next prime is 10153577535121. The reversal of 10153577535089 is 98053577535101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9721425126400 + 432152408689 = 3117920^2 + 657383^2 .
It is a cyclic number.
It is not a de Polignac number, because 10153577535089 - 28 = 10153577534833 is a prime.
It is a super-2 number, since 2×101535775350892 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10153577535029) 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, 5076788767544 + 5076788767545.
It is an arithmetic number, because the mean of its divisors is an integer number (5076788767545).
Almost surely, 210153577535089 is an apocalyptic number.
It is an amenable number.
10153577535089 is a deficient number, since it is larger than the sum of its proper divisors (1).
10153577535089 is an equidigital number, since it uses as much as digits as its factorization.
10153577535089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19845000, while the sum is 59.
The spelling of 10153577535089 in words is "ten trillion, one hundred fifty-three billion, five hundred seventy-seven million, five hundred thirty-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •