Base | Representation |
---|---|
bin | 1010100101000011010010… |
… | …1111100010101010100001 |
3 | 1112011222100010110011222020 |
4 | 2221100310233202222201 |
5 | 3011033113004044203 |
6 | 40423301550332053 |
7 | 2310234200240451 |
oct | 251206457425241 |
9 | 45158303404866 |
10 | 11631656315553 |
11 | 3784a5983196a |
12 | 137a3621ba029 |
13 | 664b25639311 |
14 | 2c2d91c17d61 |
15 | 152875776153 |
hex | a9434be2aa1 |
11631656315553 has 8 divisors (see below), whose sum is σ = 15801495372288. Its totient is φ = 7608127401264.
The previous prime is 11631656315473. The next prime is 11631656315557. The reversal of 11631656315553 is 35551365613611.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11631656315553 - 217 = 11631656184481 is a prime.
It is a super-2 number, since 2×116316563155532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11631656315496 and 11631656315505.
It is not an unprimeable number, because it can be changed into a prime (11631656315557) 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, 36577535425 + ... + 36577535742.
It is an arithmetic number, because the mean of its divisors is an integer number (1975186921536).
Almost surely, 211631656315553 is an apocalyptic number.
It is an amenable number.
11631656315553 is a deficient number, since it is larger than the sum of its proper divisors (4169839056735).
11631656315553 is an equidigital number, since it uses as much as digits as its factorization.
11631656315553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73155071223.
The product of its digits is 3645000, while the sum is 51.
The spelling of 11631656315553 in words is "eleven trillion, six hundred thirty-one billion, six hundred fifty-six million, three hundred fifteen thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •