Base | Representation |
---|---|
bin | 111000111010101111… |
… | …1101000100001100100 |
3 | 102200111102220011001000 |
4 | 1301311133220201210 |
5 | 4000311424423022 |
6 | 132052443433300 |
7 | 11554660333605 |
oct | 1616537504144 |
9 | 380442804030 |
10 | 122230311012 |
11 | 47923907867 |
12 | 1b832825830 |
13 | b6ac29c424 |
14 | 5cb7633dac |
15 | 32a5bad6ac |
hex | 1c757e8864 |
122230311012 has 24 divisors (see below), whose sum is σ = 316893399200. Its totient is φ = 40743436968.
The previous prime is 122230310971. The next prime is 122230311017. The reversal of 122230311012 is 210113032221.
122230311012 is a `hidden beast` number, since 122 + 230 + 311 + 0 + 1 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (122230311017) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 565880962 + ... + 565881177.
Almost surely, 2122230311012 is an apocalyptic number.
122230311012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
122230311012 is an abundant number, since it is smaller than the sum of its proper divisors (194663088188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122230311012 is a wasteful number, since it uses less digits than its factorization.
122230311012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1131762152 (or 1131762144 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 122230311012 its reverse (210113032221), we get a palindrome (332343343233).
The spelling of 122230311012 in words is "one hundred twenty-two billion, two hundred thirty million, three hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •