Base | Representation |
---|---|
bin | 101011101010011110111… |
… | …001100010001100110100 |
3 | 101121211221200221101022200 |
4 | 223222132321202030310 |
5 | 343130113040230103 |
6 | 10214233545224500 |
7 | 426532334101314 |
oct | 53523671421464 |
9 | 11554850841280 |
10 | 3000553055028 |
11 | a57588a80151 |
12 | 40563b192130 |
13 | 189c4929cab9 |
14 | a532853d444 |
15 | 530b808c0a3 |
hex | 2ba9ee62334 |
3000553055028 has 72 divisors (see below), whose sum is σ = 8075261867400. Its totient is φ = 936149114880.
The previous prime is 3000553055009. The next prime is 3000553055161. The reversal of 3000553055028 is 8205503550003.
3000553055028 is a `hidden beast` number, since 3 + 0 + 0 + 0 + 55 + 30 + 550 + 28 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 74339113104 + 2926213941924 = 272652^2 + 1710618^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 3000553054983 and 3000553055001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13433053 + ... + 13654596.
It is an arithmetic number, because the mean of its divisors is an integer number (112156414825).
Almost surely, 23000553055028 is an apocalyptic number.
It is an amenable number.
3000553055028 is an abundant number, since it is smaller than the sum of its proper divisors (5074708812372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3000553055028 is a wasteful number, since it uses less digits than its factorization.
3000553055028 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27087857 (or 27087852 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
The spelling of 3000553055028 in words is "three trillion, five hundred fifty-three million, fifty-five thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •