Base | Representation |
---|---|
bin | 11100101111011001… |
… | …010111001101100100 |
3 | 2221122200102211111101 |
4 | 130233121113031210 |
5 | 1001200121331100 |
6 | 22102111445444 |
7 | 2141511144334 |
oct | 345731271544 |
9 | 87580384441 |
10 | 30859948900 |
11 | 120a6700400 |
12 | 5b92b26884 |
13 | 2baa5a78c1 |
14 | 16ca73b0c4 |
15 | c0939386a |
hex | 72f657364 |
30859948900 has 81 divisors (see below), whose sum is σ = 73653474027. Its totient is φ = 11214772800.
The previous prime is 30859948897. The next prime is 30859948927. The reversal of 30859948900 is 984995803.
The square root of 30859948900 is 175670.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 6158168676 + 24701780224 = 78474^2 + 157168^2 .
It is a super-2 number, since 2×308599489002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 19322902 + ... + 19324498.
Almost surely, 230859948900 is an apocalyptic number.
30859948900 is the 175670-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30859948900
30859948900 is an abundant number, since it is smaller than the sum of its proper divisors (42793525127).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30859948900 is a wasteful number, since it uses less digits than its factorization.
30859948900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3230 (or 1615 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 55.
The spelling of 30859948900 in words is "thirty billion, eight hundred fifty-nine million, nine hundred forty-eight thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •