Base | Representation |
---|---|
bin | 1101101111110101110110… |
… | …10010110110111001111000 |
3 | 10222001001210212201112210210 |
4 | 12313322323102312321320 |
5 | 12430301314230041440 |
6 | 144143552532111120 |
7 | 6240061250052036 |
oct | 667727322667170 |
9 | 128031725645723 |
10 | 30231122112120 |
11 | 96a5a46343776 |
12 | 3482bb17654a0 |
13 | 13b3a23446a87 |
14 | 7672a092d556 |
15 | 3765aa629a80 |
hex | 1b7ebb4b6e78 |
30231122112120 has 128 divisors (see below), whose sum is σ = 92637544285440. Its totient is φ = 7890502763520.
The previous prime is 30231122112077. The next prime is 30231122112143. The reversal of 30231122112120 is 2121122113203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12024354 + ... + 14319473.
It is an arithmetic number, because the mean of its divisors is an integer number (723730814730).
Almost surely, 230231122112120 is an apocalyptic number.
30231122112120 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30231122112120 is an abundant number, since it is smaller than the sum of its proper divisors (62406422173320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30231122112120 is a wasteful number, since it uses less digits than its factorization.
30231122112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26344045 (or 26344041 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 30231122112120 its reverse (2121122113203), we get a palindrome (32352244225323).
The spelling of 30231122112120 in words is "thirty trillion, two hundred thirty-one billion, one hundred twenty-two million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •