Base | Representation |
---|---|
bin | 1001100101110001000100… |
… | …1100010110101010111100 |
3 | 1101100001000200021111212101 |
4 | 2121130101030112222330 |
5 | 2340224444342203230 |
6 | 34232013513114444 |
7 | 2135544612024025 |
oct | 231342114265274 |
9 | 41301020244771 |
10 | 10544433162940 |
11 | 33a596169a486 |
12 | 12236b93b8a24 |
13 | 5b6449930391 |
14 | 2864d35cbc4c |
15 | 134441847aca |
hex | 99711316abc |
10544433162940 has 48 divisors (see below), whose sum is σ = 23431499804160. Its totient is φ = 3977569386560.
The previous prime is 10544433162929. The next prime is 10544433162959. The reversal of 10544433162940 is 4926133444501.
It is a happy number.
It is a super-2 number, since 2×105444331629402 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 161394670 + ... + 161459989.
It is an arithmetic number, because the mean of its divisors is an integer number (488156245920).
Almost surely, 210544433162940 is an apocalyptic number.
10544433162940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10544433162940 is an abundant number, since it is smaller than the sum of its proper divisors (12887066641220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10544433162940 is a wasteful number, since it uses less digits than its factorization.
10544433162940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322854762 (or 322854760 counting only the distinct ones).
The product of its (nonzero) digits is 1244160, while the sum is 46.
The spelling of 10544433162940 in words is "ten trillion, five hundred forty-four billion, four hundred thirty-three million, one hundred sixty-two thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •