Base | Representation |
---|---|
bin | 11100000010101101… |
… | …101101111011101000 |
3 | 2212201102212020102010 |
4 | 130002231231323220 |
5 | 443131214410440 |
6 | 21455452235520 |
7 | 2114106261462 |
oct | 340255557350 |
9 | 85642766363 |
10 | 30110310120 |
11 | 11851537720 |
12 | 5a03a6bba0 |
13 | 2abb1a8667 |
14 | 1658d61132 |
15 | bb3668580 |
hex | 702b6dee8 |
30110310120 has 64 divisors (see below), whose sum is σ = 98542837440. Its totient is φ = 7299468800.
The previous prime is 30110310119. The next prime is 30110310149. The reversal of 30110310120 is 2101301103.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 30110310096 and 30110310105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11404101 + ... + 11406740.
It is an arithmetic number, because the mean of its divisors is an integer number (1539731835).
Almost surely, 230110310120 is an apocalyptic number.
30110310120 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30110310120 is an abundant number, since it is smaller than the sum of its proper divisors (68432527320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30110310120 is a wasteful number, since it uses less digits than its factorization.
30110310120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22810866 (or 22810862 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 30110310120 its reverse (2101301103), we get a palindrome (32211611223).
The spelling of 30110310120 in words is "thirty billion, one hundred ten million, three hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •