Base | Representation |
---|---|
bin | 101100011101001100001… |
… | …110001001100011111010 |
3 | 101211001111020110102212110 |
4 | 230131030032021203322 |
5 | 400023120113300200 |
6 | 10255240423353150 |
7 | 433500522002055 |
oct | 54351416114372 |
9 | 11731436412773 |
10 | 3055000525050 |
11 | a78689175261 |
12 | 4140b55b27b6 |
13 | 192115583496 |
14 | a7c117c3a9c |
15 | 547030e5b50 |
hex | 2c74c3898fa |
3055000525050 has 24 divisors (see below), whose sum is σ = 7576401302496. Its totient is φ = 814666806640.
The previous prime is 3055000525021. The next prime is 3055000525091. The reversal of 3055000525050 is 505250005503.
3055000525050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 3055000524999 and 3055000525017.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10183334934 + ... + 10183335233.
It is an arithmetic number, because the mean of its divisors is an integer number (315683387604).
Almost surely, 23055000525050 is an apocalyptic number.
3055000525050 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3055000525050 is an abundant number, since it is smaller than the sum of its proper divisors (4521400777446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3055000525050 is a wasteful number, since it uses less digits than its factorization.
3055000525050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20366670182 (or 20366670177 counting only the distinct ones).
The product of its (nonzero) digits is 18750, while the sum is 30.
The spelling of 3055000525050 in words is "three trillion, fifty-five billion, five hundred twenty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •