Base | Representation |
---|---|
bin | 11011111111110010… |
… | …100001111101000000 |
3 | 2212121000112020001000 |
4 | 123333302201331000 |
5 | 443031134141003 |
6 | 21450540412000 |
7 | 2112642216333 |
oct | 337762417500 |
9 | 85530466030 |
10 | 30061240128 |
11 | 11826871707 |
12 | 59ab547000 |
13 | 2ab0c8766a |
14 | 165262a61a |
15 | bae1c41a3 |
hex | 6ffca1f40 |
30061240128 has 112 divisors (see below), whose sum is σ = 89439658560. Its totient is φ = 9899638272.
The previous prime is 30061240117. The next prime is 30061240129. The reversal of 30061240128 is 82104216003.
30061240128 is a `hidden beast` number, since 3 + 0 + 0 + 612 + 40 + 1 + 2 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30061240129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38626 + ... + 248222.
It is an arithmetic number, because the mean of its divisors is an integer number (798568380).
Almost surely, 230061240128 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 30061240128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44719829280).
30061240128 is an abundant number, since it is smaller than the sum of its proper divisors (59378418432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30061240128 is a wasteful number, since it uses less digits than its factorization.
30061240128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209701 (or 209685 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The spelling of 30061240128 in words is "thirty billion, sixty-one million, two hundred forty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •