Base | Representation |
---|---|
bin | 11011111101111111… |
… | …010111100111000000 |
3 | 2212111220201110121120 |
4 | 123331333113213000 |
5 | 443000422114300 |
6 | 21443541352240 |
7 | 2112124503063 |
oct | 337577274700 |
9 | 85456643546 |
10 | 30031051200 |
11 | 11810822287 |
12 | 59a1408680 |
13 | 2aa79476a7 |
14 | 164c60c8da |
15 | bab70e3a0 |
hex | 6fdfd79c0 |
30031051200 has 84 divisors (see below), whose sum is σ = 98526889560. Its totient is φ = 8008279040.
The previous prime is 30031051189. The next prime is 30031051207. The reversal of 30031051200 is 215013003.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 30031051200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30031051207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3123435 + ... + 3133034.
Almost surely, 230031051200 is an apocalyptic number.
30031051200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30031051200 is an abundant number, since it is smaller than the sum of its proper divisors (68495838360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30031051200 is a wasteful number, since it uses less digits than its factorization.
30031051200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6256494 (or 6256479 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 15.
Adding to 30031051200 its reverse (215013003), we get a palindrome (30246064203).
The spelling of 30031051200 in words is "thirty billion, thirty-one million, fifty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •