Base | Representation |
---|---|
bin | 111000011001111111… |
… | …1101100111000111000 |
3 | 102120122212010202122211 |
4 | 1300303333230320320 |
5 | 3441034120434430 |
6 | 131351430424504 |
7 | 11515515043414 |
oct | 1606377547070 |
9 | 376585122584 |
10 | 121131421240 |
11 | 4740a5906a5 |
12 | 1b586802134 |
13 | b565719bab |
14 | 5c11703d44 |
15 | 323e49672a |
hex | 1c33fece38 |
121131421240 has 256 divisors, whose sum is σ = 317132496000. Its totient is φ = 41328967680.
The previous prime is 121131421217. The next prime is 121131421241. The reversal of 121131421240 is 42124131121.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121131421241) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 42337410 + ... + 42340270.
Almost surely, 2121131421240 is an apocalyptic number.
121131421240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121131421240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158566248000).
121131421240 is an abundant number, since it is smaller than the sum of its proper divisors (196001074760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121131421240 is a wasteful number, since it uses less digits than its factorization.
121131421240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3050 (or 3046 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 121131421240 its reverse (42124131121), we get a palindrome (163255552361).
The spelling of 121131421240 in words is "one hundred twenty-one billion, one hundred thirty-one million, four hundred twenty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •