Base | Representation |
---|---|
bin | 11011110000111100000101… |
… | …001000001101101110001100 |
3 | 121000100122000211212000220210 |
4 | 123300330011020031232030 |
5 | 112001123344103411022 |
6 | 1111412410432042420 |
7 | 34502115045533142 |
oct | 3360740510155614 |
9 | 530318024760823 |
10 | 122110301232012 |
11 | 359a9762700185 |
12 | 11841964993410 |
13 | 5319c4b6ca722 |
14 | 2222254b17592 |
15 | e1b580dcea0c |
hex | 6f0f0520db8c |
122110301232012 has 96 divisors (see below), whose sum is σ = 294458966459392. Its totient is φ = 39355855243776.
The previous prime is 122110301231981. The next prime is 122110301232047. The reversal of 122110301232012 is 210232103011221.
It is a super-2 number, since 2×1221103012320122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122110301232012.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44790288 + ... + 47438280.
Almost surely, 2122110301232012 is an apocalyptic number.
122110301232012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
122110301232012 is an abundant number, since it is smaller than the sum of its proper divisors (172348665227380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122110301232012 is a wasteful number, since it uses less digits than its factorization.
122110301232012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2648687 (or 2648685 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 122110301232012 its reverse (210232103011221), we get a palindrome (332342404243233).
The spelling of 122110301232012 in words is "one hundred twenty-two trillion, one hundred ten billion, three hundred one million, two hundred thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •