Base | Representation |
---|---|
bin | 1010101100010101010100… |
… | …0011101110101101001100 |
3 | 1112121221020022001022210020 |
4 | 2223011111003232231030 |
5 | 3020110312121432002 |
6 | 41000551052342140 |
7 | 2322253200435612 |
oct | 253052503565514 |
9 | 45557208038706 |
10 | 11756752530252 |
11 | 382301333a574 |
12 | 139a654774950 |
13 | 67387059bb32 |
14 | 2c905bd096b2 |
15 | 155c47d3b2bc |
hex | ab1550eeb4c |
11756752530252 has 24 divisors (see below), whose sum is σ = 27808209183216. Its totient is φ = 3865233708288.
The previous prime is 11756752530223. The next prime is 11756752530277. The reversal of 11756752530252 is 25203525765711.
11756752530252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11756752530195 and 11756752530204.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6710474313 + ... + 6710476064.
It is an arithmetic number, because the mean of its divisors is an integer number (1158675382634).
Almost surely, 211756752530252 is an apocalyptic number.
11756752530252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11756752530252 is an abundant number, since it is smaller than the sum of its proper divisors (16051456652964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11756752530252 is a wasteful number, since it uses less digits than its factorization.
11756752530252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13420950457 (or 13420950455 counting only the distinct ones).
The product of its (nonzero) digits is 4410000, while the sum is 51.
The spelling of 11756752530252 in words is "eleven trillion, seven hundred fifty-six billion, seven hundred fifty-two million, five hundred thirty thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •