Base | Representation |
---|---|
bin | 101100000101111101001… |
… | …101111100010011010110 |
3 | 101201200002120211011222022 |
4 | 230011331031330103112 |
5 | 344121022001004200 |
6 | 10235553110133142 |
7 | 431625350264450 |
oct | 54057515742326 |
9 | 11650076734868 |
10 | 3030052750550 |
11 | a6904686a001 |
12 | 40b2b26511b2 |
13 | 18c96ab04337 |
14 | a69263532d0 |
15 | 53c42cdc885 |
hex | 2c17d37c4d6 |
3030052750550 has 48 divisors (see below), whose sum is σ = 6441217735680. Its totient is φ = 1038844371360.
The previous prime is 3030052750531. The next prime is 3030052750601. The reversal of 3030052750550 is 550572500303.
It is a super-2 number, since 2×30300527505502 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 3030052750550.
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 23 ways as a sum of consecutive naturals, for example, 13834997 + ... + 14052303.
It is an arithmetic number, because the mean of its divisors is an integer number (134192036160).
Almost surely, 23030052750550 is an apocalyptic number.
3030052750550 is an abundant number, since it is smaller than the sum of its proper divisors (3411164985130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3030052750550 is a wasteful number, since it uses less digits than its factorization.
3030052750550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257165 (or 257160 counting only the distinct ones).
The product of its (nonzero) digits is 78750, while the sum is 35.
The spelling of 3030052750550 in words is "three trillion, thirty billion, fifty-two million, seven hundred fifty thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.352 sec. • engine limits •