Base | Representation |
---|---|
bin | 111000111010110001… |
… | …0110001001111000000 |
3 | 102200111111102220202110 |
4 | 1301311202301033000 |
5 | 4000312132224440 |
6 | 132052513215320 |
7 | 11555000326455 |
oct | 1616542611700 |
9 | 380444386673 |
10 | 122231133120 |
11 | 47924319498 |
12 | 1b832b61540 |
13 | b6ac4c9695 |
14 | 5cb77a982c |
15 | 32a5cc2080 |
hex | 1c758b13c0 |
122231133120 has 112 divisors (see below), whose sum is σ = 388152851328. Its totient is φ = 32589173760.
The previous prime is 122231133119. The next prime is 122231133121. The reversal of 122231133120 is 21331132221.
It is an interprime number because it is at equal distance from previous prime (122231133119) and next prime (122231133121).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122231133121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10003815 + ... + 10016025.
Almost surely, 2122231133120 is an apocalyptic number.
122231133120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122231133120 is an abundant number, since it is smaller than the sum of its proper divisors (265921718208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122231133120 is a wasteful number, since it uses less digits than its factorization.
122231133120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22658 (or 22648 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 122231133120 its reverse (21331132221), we get a palindrome (143562265341).
The spelling of 122231133120 in words is "one hundred twenty-two billion, two hundred thirty-one million, one hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •