Base | Representation |
---|---|
bin | 11100001011010110… |
… | …111000101111000000 |
3 | 2220002112201111120102 |
4 | 130023112320233000 |
5 | 443430330220000 |
6 | 21522112301532 |
7 | 2120516656013 |
oct | 341326705700 |
9 | 86075644512 |
10 | 30255320000 |
11 | 119163807a4 |
12 | 5a445418a8 |
13 | 2b1224b119 |
14 | 167030b37a |
15 | bc125e3d5 |
hex | 70b5b8bc0 |
30255320000 has 140 divisors (see below), whose sum is σ = 75735225720. Its totient is φ = 11987328000.
The previous prime is 30255319973. The next prime is 30255320083. The reversal of 30255320000 is 2355203.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4276466 + ... + 4283534.
It is an arithmetic number, because the mean of its divisors is an integer number (540965898).
Almost surely, 230255320000 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 30255320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37867612860).
30255320000 is an abundant number, since it is smaller than the sum of its proper divisors (45479905720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30255320000 is an equidigital number, since it uses as much as digits as its factorization.
30255320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7208 (or 7183 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 20.
Adding to 30255320000 its reverse (2355203), we get a palindrome (30257675203).
The spelling of 30255320000 in words is "thirty billion, two hundred fifty-five million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •