Base | Representation |
---|---|
bin | 11011111111010001… |
… | …101111100101101110 |
3 | 2212120102100120001110 |
4 | 123333101233211232 |
5 | 443021434121410 |
6 | 21450032252450 |
7 | 2112506161326 |
oct | 337721574556 |
9 | 85512316043 |
10 | 30052645230 |
11 | 11821a31193 |
12 | 59a86a1126 |
13 | 2aac26851a |
14 | 1651430286 |
15 | bad577720 |
hex | 6ff46f96e |
30052645230 has 64 divisors (see below), whose sum is σ = 76248656640. Its totient is φ = 7559629056.
The previous prime is 30052645193. The next prime is 30052645241. The reversal of 30052645230 is 3254625003.
It is a super-2 number, since 2×300526452302 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
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, 19669 + ... + 245951.
It is an arithmetic number, because the mean of its divisors is an integer number (1191385260).
Almost surely, 230052645230 is an apocalyptic number.
30052645230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 30052645230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38124328320).
30052645230 is an abundant number, since it is smaller than the sum of its proper divisors (46196011410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30052645230 is a wasteful number, since it uses less digits than its factorization.
30052645230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 226545.
The product of its (nonzero) digits is 21600, while the sum is 30.
The spelling of 30052645230 in words is "thirty billion, fifty-two million, six hundred forty-five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •