Base | Representation |
---|---|
bin | 1010100000011110010011… |
… | …0110100011001011100001 |
3 | 1111220110022220001211201102 |
4 | 2220013210312203023201 |
5 | 3003241024140022230 |
6 | 40323213345244145 |
7 | 2301451162340441 |
oct | 250074466431341 |
9 | 44813286054642 |
10 | 11553006564065 |
11 | 375466a02354a |
12 | 1367072633655 |
13 | 65a5a0183a25 |
14 | 2bd250520121 |
15 | 1507c0ac1045 |
hex | a81e4da32e1 |
11553006564065 has 8 divisors (see below), whose sum is σ = 13875346756008. Its totient is φ = 9234579331840.
The previous prime is 11553006564061. The next prime is 11553006564079. The reversal of 11553006564065 is 56046560035511.
It can be written as a sum of positive squares in 4 ways, for example, as 1187749045921 + 10365257518144 = 1089839^2 + 3219512^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11553006564065 - 22 = 11553006564061 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11553006564061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 978233432 + ... + 978245241.
It is an arithmetic number, because the mean of its divisors is an integer number (1734418344501).
Almost surely, 211553006564065 is an apocalyptic number.
It is an amenable number.
11553006564065 is a deficient number, since it is larger than the sum of its proper divisors (2322340191943).
11553006564065 is a wasteful number, since it uses less digits than its factorization.
11553006564065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1956479859.
The product of its (nonzero) digits is 1620000, while the sum is 47.
Adding to 11553006564065 its reverse (56046560035511), we get a palindrome (67599566599576).
The spelling of 11553006564065 in words is "eleven trillion, five hundred fifty-three billion, six million, five hundred sixty-four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •