Base | Representation |
---|---|
bin | 1101110010001000110111… |
… | …10101110110101000101000 |
3 | 10222022121112120221020121102 |
4 | 12321010123311312220220 |
5 | 12433044441113410440 |
6 | 144244124554500532 |
7 | 6245554220135651 |
oct | 671043365665050 |
9 | 128277476836542 |
10 | 30310051310120 |
11 | 972646986841a |
12 | 349635aa34748 |
13 | 13bb2c1781b2a |
14 | 76b02b3aa528 |
15 | 378679acdb15 |
hex | 1b911bd76a28 |
30310051310120 has 32 divisors (see below), whose sum is σ = 68197838284800. Its totient is φ = 12123980908608.
The previous prime is 30310051310089. The next prime is 30310051310141. The reversal of 30310051310120 is 2101315001303.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 30310051310092 and 30310051310101.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 13249961 + ... + 15368199.
It is an arithmetic number, because the mean of its divisors is an integer number (2131182446400).
Almost surely, 230310051310120 is an apocalyptic number.
It is an amenable number.
30310051310120 is an abundant number, since it is smaller than the sum of its proper divisors (37887786974680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30310051310120 is a wasteful number, since it uses less digits than its factorization.
30310051310120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2475977 (or 2475973 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 30310051310120 its reverse (2101315001303), we get a palindrome (32411366311423).
The spelling of 30310051310120 in words is "thirty trillion, three hundred ten billion, fifty-one million, three hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •