Base | Representation |
---|---|
bin | 11011010010100010011000… |
… | …111001000000101100010100 |
3 | 120201221220111222212021122122 |
4 | 123102202120321000230110 |
5 | 111212411234041420200 |
6 | 1103132540235515112 |
7 | 34165145342345060 |
oct | 3322423071005424 |
9 | 521856458767578 |
10 | 120021131201300 |
11 | 3527374868953a |
12 | 11564a95bb8a98 |
13 | 51c7c3728ac94 |
14 | 218d0a7696aa0 |
15 | dd205986c385 |
hex | 6d2898e40b14 |
120021131201300 has 72 divisors (see below), whose sum is σ = 297661283041920. Its totient is φ = 41148874800000.
The previous prime is 120021131201227. The next prime is 120021131201317. The reversal of 120021131201300 is 3102131120021.
It is a super-2 number, since 2×1200211312013002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 21085646 + ... + 26165754.
Almost surely, 2120021131201300 is an apocalyptic number.
120021131201300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120021131201300 is an abundant number, since it is smaller than the sum of its proper divisors (177640151840620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120021131201300 is a wasteful number, since it uses less digits than its factorization.
120021131201300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5113881 (or 5113874 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 120021131201300 its reverse (3102131120021), we get a palindrome (123123262321321).
The spelling of 120021131201300 in words is "one hundred twenty trillion, twenty-one billion, one hundred thirty-one million, two hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •