Base | Representation |
---|---|
bin | 11011111111110001… |
… | …110010101010000000 |
3 | 2212121000011101021220 |
4 | 123333301302222000 |
5 | 443031111441100 |
6 | 21450532315040 |
7 | 2112640451460 |
oct | 337761625200 |
9 | 85530141256 |
10 | 30061046400 |
11 | 1182674a100 |
12 | 59ab472a80 |
13 | 2ab0c1a428 |
14 | 16525b9ba0 |
15 | bae186aa0 |
hex | 6ffc72a80 |
30061046400 has 576 divisors, whose sum is σ = 124414328640. Its totient is φ = 6244761600.
The previous prime is 30061046387. The next prime is 30061046401. The reversal of 30061046400 is 464016003.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30061046401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 8129352 + ... + 8133048.
Almost surely, 230061046400 is an apocalyptic number.
30061046400 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30061046400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62207164320).
30061046400 is an abundant number, since it is smaller than the sum of its proper divisors (94353282240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30061046400 is a wasteful number, since it uses less digits than its factorization.
30061046400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3753 (or 3725 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
The spelling of 30061046400 in words is "thirty billion, sixty-one million, forty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •