Base | Representation |
---|---|
bin | 11011100000110010111110… |
… | …001110011001111000010110 |
3 | 120212102120202102220100211000 |
4 | 123200302332032121320112 |
5 | 111324440032042004344 |
6 | 1105203032513324130 |
7 | 34326014554552221 |
oct | 3340627616317026 |
9 | 525376672810730 |
10 | 121001010109974 |
11 | 35611270798735 |
12 | 116a2981566646 |
13 | 5269466a62307 |
14 | 21c46a16d65b8 |
15 | dec7a98e8a69 |
hex | 6e0cbe399e16 |
121001010109974 has 96 divisors (see below), whose sum is σ = 273221702691840. Its totient is φ = 39694213502064.
The previous prime is 121001010109951. The next prime is 121001010109979. The reversal of 121001010109974 is 479901010100121.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121001010109979) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 257442787 + ... + 257912369.
It is an arithmetic number, because the mean of its divisors is an integer number (2846059403040).
Almost surely, 2121001010109974 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121001010109974, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136610851345920).
121001010109974 is an abundant number, since it is smaller than the sum of its proper divisors (152220692581866).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121001010109974 is a wasteful number, since it uses less digits than its factorization.
121001010109974 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470791 (or 470718 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 36.
The spelling of 121001010109974 in words is "one hundred twenty-one trillion, one billion, ten million, one hundred nine thousand, nine hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •