Base | Representation |
---|---|
bin | 11011111111010110… |
… | …111100111000100000 |
3 | 2212120111220220201022 |
4 | 123333112330320200 |
5 | 443022311313100 |
6 | 21450121425012 |
7 | 2112523605401 |
oct | 337726747040 |
9 | 85514826638 |
10 | 30054010400 |
11 | 11822783927 |
12 | 59a903b168 |
13 | 2aac625a0b |
14 | 16516a79a8 |
15 | bad746e85 |
hex | 6ff5bce20 |
30054010400 has 144 divisors (see below), whose sum is σ = 74972092104. Its totient is φ = 11760353280.
The previous prime is 30054010367. The next prime is 30054010403. The reversal of 30054010400 is 401045003.
It can be written as a sum of positive squares in 12 ways, for example, as 781537936 + 29272472464 = 27956^2 + 171092^2 .
It is a super-2 number, since 2×300540104002 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30054010403) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18358382 + ... + 18360018.
Almost surely, 230054010400 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 30054010400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37486046052).
30054010400 is an abundant number, since it is smaller than the sum of its proper divisors (44918081704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30054010400 is a wasteful number, since it uses less digits than its factorization.
30054010400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2143 (or 2130 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 17.
Adding to 30054010400 its reverse (401045003), we get a palindrome (30455055403).
The spelling of 30054010400 in words is "thirty billion, fifty-four million, ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.898 sec. • engine limits •