Base | Representation |
---|---|
bin | 101011101110101001011… |
… | …101110010111000111000 |
3 | 101122021111101020222010020 |
4 | 223232221131302320320 |
5 | 343213242434100044 |
6 | 10220253425050440 |
7 | 430051220413416 |
oct | 53565135627070 |
9 | 11567441228106 |
10 | 3005025300024 |
11 | a59473493aa0 |
12 | 406488a86a20 |
13 | 18a4ac9a9407 |
14 | a56304a22b6 |
15 | 5327a9e6a19 |
hex | 2bba9772e38 |
3005025300024 has 128 divisors (see below), whose sum is σ = 8271283680000. Its totient is φ = 902202255360.
The previous prime is 3005025300007. The next prime is 3005025300049. The reversal of 3005025300024 is 4200035205003.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 3005025299967 and 3005025300003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 81989847 + ... + 82026489.
It is an arithmetic number, because the mean of its divisors is an integer number (64619403750).
Almost surely, 23005025300024 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3005025300024, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4135641840000).
3005025300024 is an abundant number, since it is smaller than the sum of its proper divisors (5266258379976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3005025300024 is a wasteful number, since it uses less digits than its factorization.
3005025300024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39525 (or 39521 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 24.
The spelling of 3005025300024 in words is "three trillion, five billion, twenty-five million, three hundred thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •