Base | Representation |
---|---|
bin | 11100000010110000… |
… | …011011010100100000 |
3 | 2212201111012022121211 |
4 | 130002300123110200 |
5 | 443131410122240 |
6 | 21455515355504 |
7 | 2114115310153 |
oct | 340260332440 |
9 | 85644168554 |
10 | 30111020320 |
11 | 11851982267 |
12 | 5a04152b94 |
13 | 2abb3969b4 |
14 | 16590a7c9a |
15 | bb3758bea |
hex | 702c1b520 |
30111020320 has 48 divisors (see below), whose sum is σ = 73059929208. Its totient is φ = 11718881280.
The previous prime is 30111020299. The next prime is 30111020321. The reversal of 30111020320 is 2302011103.
It can be written as a sum of positive squares in 4 ways, for example, as 29519363344 + 591656976 = 171812^2 + 24324^2 .
It is a super-2 number, since 2×301110203202 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30111020320.
It is not an unprimeable number, because it can be changed into a prime (30111020321) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2537241 + ... + 2549080.
Almost surely, 230111020320 is an apocalyptic number.
It is an amenable number.
30111020320 is an abundant number, since it is smaller than the sum of its proper divisors (42948908888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30111020320 is a wasteful number, since it uses less digits than its factorization.
30111020320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5086373 (or 5086365 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 30111020320 its reverse (2302011103), we get a palindrome (32413031423).
The spelling of 30111020320 in words is "thirty billion, one hundred eleven million, twenty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •