Base | Representation |
---|---|
bin | 1001101011101001101100… |
… | …1000000111101001011000 |
3 | 1101200200222101202000201211 |
4 | 2122322123020013221120 |
5 | 2343404022034301230 |
6 | 34350253434352504 |
7 | 2146054124134654 |
oct | 232723310075130 |
9 | 41620871660654 |
10 | 10645531556440 |
11 | 3434821042900 |
12 | 123b212b8b734 |
13 | 5c2b3bb7a4b1 |
14 | 28b36448da64 |
15 | 136dac1ec42a |
hex | 9ae9b207a58 |
10645531556440 has 96 divisors (see below), whose sum is σ = 26517306186000. Its totient is φ = 3843252483840.
The previous prime is 10645531556399. The next prime is 10645531556483. The reversal of 10645531556440 is 4465513554601.
It is a super-2 number, since 2×106455315564402 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7239075 + ... + 8584594.
Almost surely, 210645531556440 is an apocalyptic number.
10645531556440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10645531556440 is an abundant number, since it is smaller than the sum of its proper divisors (15871774629560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10645531556440 is a wasteful number, since it uses less digits than its factorization.
10645531556440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15823841 (or 15823826 counting only the distinct ones).
The product of its (nonzero) digits is 4320000, while the sum is 49.
The spelling of 10645531556440 in words is "ten trillion, six hundred forty-five billion, five hundred thirty-one million, five hundred fifty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •