Base | Representation |
---|---|
bin | 11011100101010101101001… |
… | …011100111001110101010000 |
3 | 120220112102100221120220211201 |
4 | 123211111221130321311100 |
5 | 111400043232314210422 |
6 | 1110002251141320544 |
7 | 34360404134012050 |
oct | 3345255134716520 |
9 | 526472327526751 |
10 | 121313120460112 |
11 | 35721672967269 |
12 | 11733366706154 |
13 | 528ca16851279 |
14 | 21d582cd7d560 |
15 | e05975374727 |
hex | 6e5569739d50 |
121313120460112 has 80 divisors (see below), whose sum is σ = 282766547040640. Its totient is φ = 49253794136064.
The previous prime is 121313120460101. The next prime is 121313120460113. The reversal of 121313120460112 is 211064021313121.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121313120460113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93020608 + ... + 94315744.
It is an arithmetic number, because the mean of its divisors is an integer number (3534581838008).
Almost surely, 2121313120460112 is an apocalyptic number.
It is an amenable number.
121313120460112 is an abundant number, since it is smaller than the sum of its proper divisors (161453426580528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121313120460112 is a wasteful number, since it uses less digits than its factorization.
121313120460112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1339188 (or 1339182 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 28.
Adding to 121313120460112 its reverse (211064021313121), we get a palindrome (332377141773233).
The spelling of 121313120460112 in words is "one hundred twenty-one trillion, three hundred thirteen billion, one hundred twenty million, four hundred sixty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •