Base | Representation |
---|---|
bin | 11100100100011001… |
… | …111110100000000000 |
3 | 2221011211110221002110 |
4 | 130210121332200000 |
5 | 1000310420413243 |
6 | 22031523415320 |
7 | 2134111650561 |
oct | 344431764000 |
9 | 87154427073 |
10 | 30675560448 |
11 | 12011610655 |
12 | 5b41224540 |
13 | 2b7b328400 |
14 | 16b0060168 |
15 | be80bee33 |
hex | 72467e800 |
30675560448 has 288 divisors, whose sum is σ = 91508901120. Its totient is φ = 9124577280.
The previous prime is 30675560423. The next prime is 30675560449. The reversal of 30675560448 is 84406557603.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 30675560397 and 30675560406.
It is not an unprimeable number, because it can be changed into a prime (30675560449) 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, 32187940 + ... + 32188892.
It is an arithmetic number, because the mean of its divisors is an integer number (317739240).
Almost surely, 230675560448 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 30675560448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45754450560).
30675560448 is an abundant number, since it is smaller than the sum of its proper divisors (60833340672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30675560448 is a wasteful number, since it uses less digits than its factorization.
30675560448 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1035 (or 1002 counting only the distinct ones).
The product of its (nonzero) digits is 2419200, while the sum is 48.
The spelling of 30675560448 in words is "thirty billion, six hundred seventy-five million, five hundred sixty thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •