Base | Representation |
---|---|
bin | 11100001010010001… |
… | …110001000010101000 |
3 | 2220001021121221100202 |
4 | 130022101301002220 |
5 | 443411210404202 |
6 | 21520224051332 |
7 | 2120206651436 |
oct | 341221610250 |
9 | 86037557322 |
10 | 30237200552 |
11 | 11907125349 |
12 | 5a3a463b48 |
13 | 2b0b575960 |
14 | 166bb51d56 |
15 | bbe880802 |
hex | 70a4710a8 |
30237200552 has 128 divisors (see below), whose sum is σ = 70398720000. Its totient is φ = 12013940736.
The previous prime is 30237200537. The next prime is 30237200561. The reversal of 30237200552 is 25500273203.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (29).
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 31 ways as a sum of consecutive naturals, for example, 958649 + ... + 989687.
It is an arithmetic number, because the mean of its divisors is an integer number (549990000).
Almost surely, 230237200552 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 30237200552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35199360000).
30237200552 is an abundant number, since it is smaller than the sum of its proper divisors (40161519448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30237200552 is a wasteful number, since it uses less digits than its factorization.
30237200552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31123 (or 31119 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 29.
Adding to 30237200552 its reverse (25500273203), we get a palindrome (55737473755).
The spelling of 30237200552 in words is "thirty billion, two hundred thirty-seven million, two hundred thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •