Base | Representation |
---|---|
bin | 1010010101000110001000… |
… | …0011010111100100001110 |
3 | 1111012202210101120110100211 |
4 | 2211101202003113210032 |
5 | 2442040214334041000 |
6 | 40053325312113034 |
7 | 2251361252032165 |
oct | 245214203274416 |
9 | 44182711513324 |
10 | 11357538580750 |
11 | 368978349058a |
12 | 133520083577a |
13 | 64501ba6b23b |
14 | 2b39ca2c03dc |
15 | 14a6804617ba |
hex | a54620d790e |
11357538580750 has 64 divisors (see below), whose sum is σ = 23490759487104. Its totient is φ = 4089875750400.
The previous prime is 11357538580637. The next prime is 11357538580781. The reversal of 11357538580750 is 5708583575311.
It is a super-2 number, since 2×113575385807502 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 57997077 + ... + 58192576.
It is an arithmetic number, because the mean of its divisors is an integer number (367043116986).
Almost surely, 211357538580750 is an apocalyptic number.
11357538580750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11357538580750 is an abundant number, since it is smaller than the sum of its proper divisors (12133220906354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11357538580750 is a wasteful number, since it uses less digits than its factorization.
11357538580750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116189710 (or 116189700 counting only the distinct ones).
The product of its (nonzero) digits is 17640000, while the sum is 58.
The spelling of 11357538580750 in words is "eleven trillion, three hundred fifty-seven billion, five hundred thirty-eight million, five hundred eighty thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •