Base | Representation |
---|---|
bin | 111000110111001010… |
… | …0101100001101011100 |
3 | 102200012001111211010010 |
4 | 1301232110230031130 |
5 | 4000040130031022 |
6 | 132032505043220 |
7 | 11551666614525 |
oct | 1615624541534 |
9 | 380161454103 |
10 | 122110002012 |
11 | 47871a04939 |
12 | 1b7ba486510 |
13 | b69039797b |
14 | 5ca567784c |
15 | 329a34650c |
hex | 1c6e52c35c |
122110002012 has 48 divisors (see below), whose sum is σ = 295567372800. Its totient is φ = 39207891840.
The previous prime is 122110002011. The next prime is 122110002017. The reversal of 122110002012 is 210200011221.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122110002011) 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 15 ways as a sum of consecutive naturals, for example, 1531962 + ... + 1609697.
It is an arithmetic number, because the mean of its divisors is an integer number (6157653600).
Almost surely, 2122110002012 is an apocalyptic number.
122110002012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
122110002012 is an abundant number, since it is smaller than the sum of its proper divisors (173457370788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122110002012 is a wasteful number, since it uses less digits than its factorization.
122110002012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3141786 (or 3141784 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 122110002012 its reverse (210200011221), we get a palindrome (332310013233).
The spelling of 122110002012 in words is "one hundred twenty-two billion, one hundred ten million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •