Base | Representation |
---|---|
bin | 11100000010010110… |
… | …001100101000101000 |
3 | 2212201000020222200000 |
4 | 130002112030220220 |
5 | 443123130110144 |
6 | 21455112143000 |
7 | 2114003001624 |
oct | 340226145050 |
9 | 85630228600 |
10 | 30104144424 |
11 | 11849006302 |
12 | 5a01997a60 |
13 | 2ab9b2a113 |
14 | 16581d8184 |
15 | bb2d4b769 |
hex | 70258ca28 |
30104144424 has 96 divisors (see below), whose sum is σ = 85985172000. Its totient is φ = 9864597312.
The previous prime is 30104144393. The next prime is 30104144437. The reversal of 30104144424 is 42444140103.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16539 + ... + 245930.
It is an arithmetic number, because the mean of its divisors is an integer number (895678875).
Almost surely, 230104144424 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 30104144424, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42992586000).
30104144424 is an abundant number, since it is smaller than the sum of its proper divisors (55881027576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30104144424 is a wasteful number, since it uses less digits than its factorization.
30104144424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262549 (or 262533 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 30104144424 its reverse (42444140103), we get a palindrome (72548284527).
The spelling of 30104144424 in words is "thirty billion, one hundred four million, one hundred forty-four thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •