Base | Representation |
---|---|
bin | 1010100110011101100000… |
… | …1011000100111011101001 |
3 | 1112021021211211112002100012 |
4 | 2221213120023010323221 |
5 | 3011432212000301424 |
6 | 40442344551221305 |
7 | 2312052254161634 |
oct | 251473013047351 |
9 | 45237754462305 |
10 | 11655873056489 |
11 | 3794256521852 |
12 | 1382ba0377835 |
13 | 6671b480181c |
14 | 2c420c152c1b |
15 | 1532e17cbb0e |
hex | a99d82c4ee9 |
11655873056489 has 2 divisors, whose sum is σ = 11655873056490. Its totient is φ = 11655873056488.
The previous prime is 11655873056293. The next prime is 11655873056533. The reversal of 11655873056489 is 98465037855611.
11655873056489 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10596867410089 + 1059005646400 = 3255283^2 + 1029080^2 .
It is a cyclic number.
It is not a de Polignac number, because 11655873056489 - 212 = 11655873052393 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11655873050489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5827936528244 + 5827936528245.
It is an arithmetic number, because the mean of its divisors is an integer number (5827936528245).
Almost surely, 211655873056489 is an apocalyptic number.
It is an amenable number.
11655873056489 is a deficient number, since it is larger than the sum of its proper divisors (1).
11655873056489 is an equidigital number, since it uses as much as digits as its factorization.
11655873056489 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 217728000, while the sum is 68.
The spelling of 11655873056489 in words is "eleven trillion, six hundred fifty-five billion, eight hundred seventy-three million, fifty-six thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •