Base | Representation |
---|---|
bin | 11100010000010100… |
… | …000000110101000000 |
3 | 2220022100011002100000 |
4 | 130100110000311000 |
5 | 444113120442200 |
6 | 21534242200000 |
7 | 2122546410465 |
oct | 342024006500 |
9 | 86270132300 |
10 | 30338452800 |
11 | 119592a1697 |
12 | 5a68353000 |
13 | 2b26537426 |
14 | 167b38b66c |
15 | bc86d1300 |
hex | 710500d40 |
30338452800 has 252 divisors, whose sum is σ = 111825162176. Its totient is φ = 8090150400.
The previous prime is 30338452757. The next prime is 30338452801. The reversal of 30338452800 is 825483303.
30338452800 is a `hidden beast` number, since 3 + 0 + 338 + 45 + 280 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30338452801) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 349785 + ... + 427815.
Almost surely, 230338452800 is an apocalyptic number.
30338452800 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30338452800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55912581088).
30338452800 is an abundant number, since it is smaller than the sum of its proper divisors (81486709376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30338452800 is an equidigital number, since it uses as much as digits as its factorization.
30338452800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78068 (or 78041 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The spelling of 30338452800 in words is "thirty billion, three hundred thirty-eight million, four hundred fifty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •