Base | Representation |
---|---|
bin | 111000100001110000… |
… | …1110110110101101100 |
3 | 102121100000112012222010 |
4 | 1301003201312311230 |
5 | 3442102330030012 |
6 | 131433340321220 |
7 | 11525131154016 |
oct | 1610341666554 |
9 | 377300465863 |
10 | 121392033132 |
11 | 47533702227 |
12 | 1b639b43210 |
13 | b5a7706806 |
14 | 5c381831b6 |
15 | 32572c4c3c |
hex | 1c43876d6c |
121392033132 has 24 divisors (see below), whose sum is σ = 295563211776. Its totient is φ = 38704706128.
The previous prime is 121392033131. The next prime is 121392033137. The reversal of 121392033132 is 231330293121.
It is a self number, because there is not a number n which added to its sum of digits gives 121392033132.
It is not an unprimeable number, because it can be changed into a prime (121392033131) 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 7 ways as a sum of consecutive naturals, for example, 219912828 + ... + 219913379.
It is an arithmetic number, because the mean of its divisors is an integer number (12315133824).
Almost surely, 2121392033132 is an apocalyptic number.
121392033132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121392033132 is an abundant number, since it is smaller than the sum of its proper divisors (174171178644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121392033132 is a wasteful number, since it uses less digits than its factorization.
121392033132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439826237 (or 439826235 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 30.
The spelling of 121392033132 in words is "one hundred twenty-one billion, three hundred ninety-two million, thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •