Base | Representation |
---|---|
bin | 1001001000101110011100… |
… | …1001010001001010001000 |
3 | 1022120100012222011020011220 |
4 | 2102023213021101022020 |
5 | 2304041201421121040 |
6 | 33210502210322040 |
7 | 2054523065633352 |
oct | 222134711211210 |
9 | 38510188136156 |
10 | 10045511504520 |
11 | 32233063a3a78 |
12 | 1162a79589320 |
13 | 57b39801c05b |
14 | 26a2c36aa0d2 |
15 | 12649071d2d0 |
hex | 922e7251288 |
10045511504520 has 128 divisors (see below), whose sum is σ = 30873135847680. Its totient is φ = 2613334016000.
The previous prime is 10045511504507. The next prime is 10045511504533. The reversal of 10045511504520 is 2540511554001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10045511504507) and next prime (10045511504533).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 130641685 + ... + 130718555.
It is an arithmetic number, because the mean of its divisors is an integer number (241196373810).
Almost surely, 210045511504520 is an apocalyptic number.
10045511504520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10045511504520 is an abundant number, since it is smaller than the sum of its proper divisors (20827624343160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10045511504520 is a wasteful number, since it uses less digits than its factorization.
10045511504520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103487 (or 103483 counting only the distinct ones).
The product of its (nonzero) digits is 20000, while the sum is 33.
The spelling of 10045511504520 in words is "ten trillion, forty-five billion, five hundred eleven million, five hundred four thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •