Base | Representation |
---|---|
bin | 1010011000000111111000… |
… | …0101110001011111110100 |
3 | 1111101202001001120012202220 |
4 | 2212001332011301133310 |
5 | 2443413223414041402 |
6 | 40133250235002340 |
7 | 2255212151526432 |
oct | 246017605613764 |
9 | 44352031505686 |
10 | 11409548580852 |
11 | 36a9842800444 |
12 | 13432b68993b0 |
13 | 649bba076c26 |
14 | 2b632194dd52 |
15 | 14bbc64e1dbc |
hex | a607e1717f4 |
11409548580852 has 12 divisors (see below), whose sum is σ = 26622280022016. Its totient is φ = 3803182860280.
The previous prime is 11409548580797. The next prime is 11409548580863. The reversal of 11409548580852 is 25808584590411.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 475397857524 + ... + 475397857547.
It is an arithmetic number, because the mean of its divisors is an integer number (2218523335168).
Almost surely, 211409548580852 is an apocalyptic number.
11409548580852 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11409548580852 is an abundant number, since it is smaller than the sum of its proper divisors (15212731441164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11409548580852 is a wasteful number, since it uses less digits than its factorization.
11409548580852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 950795715078 (or 950795715076 counting only the distinct ones).
The product of its (nonzero) digits is 18432000, while the sum is 60.
The spelling of 11409548580852 in words is "eleven trillion, four hundred nine billion, five hundred forty-eight million, five hundred eighty thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •