Base | Representation |
---|---|
bin | 11011100011110101101110… |
… | …000001110000110010000100 |
3 | 120220011120111112022121202010 |
4 | 123203311232001300302010 |
5 | 111341401310203004012 |
6 | 1105443054241414220 |
7 | 34350066501461415 |
oct | 3343655601606204 |
9 | 526146445277663 |
10 | 121210118016132 |
11 | 35691a16751602 |
12 | 117173bb33a370 |
13 | 52830accb2a72 |
14 | 21d085b27b80c |
15 | e02e47761c3c |
hex | 6e3d6e070c84 |
121210118016132 has 24 divisors (see below), whose sum is σ = 291946950921472. Its totient is φ = 39100038069600.
The previous prime is 121210118016131. The next prime is 121210118016199. The reversal of 121210118016132 is 231610811012121.
It is a self number, because there is not a number n which added to its sum of digits gives 121210118016132.
It is not an unprimeable number, because it can be changed into a prime (121210118016131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 162916824919 + ... + 162916825662.
Almost surely, 2121210118016132 is an apocalyptic number.
121210118016132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121210118016132 is an abundant number, since it is smaller than the sum of its proper divisors (170736832905340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121210118016132 is a wasteful number, since it uses less digits than its factorization.
121210118016132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 325833650619 (or 325833650617 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 30.
Adding to 121210118016132 its reverse (231610811012121), we get a palindrome (352820929028253).
The spelling of 121210118016132 in words is "one hundred twenty-one trillion, two hundred ten billion, one hundred eighteen million, sixteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •