Base | Representation |
---|---|
bin | 11011100000110010111110… |
… | …001110011100110111011010 |
3 | 120212102120202102220222120220 |
4 | 123200302332032130313122 |
5 | 111324440032042402302 |
6 | 1105203032513500510 |
7 | 34326014554632660 |
oct | 3340627616346732 |
9 | 525376672828526 |
10 | 121001010122202 |
11 | 356112707a6941 |
12 | 116a2981571736 |
13 | 5269466a67a52 |
14 | 21c46a16dac30 |
15 | dec7a98ec4bc |
hex | 6e0cbe39cdda |
121001010122202 has 256 divisors, whose sum is σ = 317069308846080. Its totient is φ = 29987355340800.
The previous prime is 121001010122197. The next prime is 121001010122203. The reversal of 121001010122202 is 202221010100121.
It is not an unprimeable number, because it can be changed into a prime (121001010122203) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 38366302 + ... + 41400182.
It is an arithmetic number, because the mean of its divisors is an integer number (1238551987680).
Almost surely, 2121001010122202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121001010122202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158534654423040).
121001010122202 is an abundant number, since it is smaller than the sum of its proper divisors (196068298723878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121001010122202 is a wasteful number, since it uses less digits than its factorization.
121001010122202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3034029.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121001010122202 its reverse (202221010100121), we get a palindrome (323222020222323).
The spelling of 121001010122202 in words is "one hundred twenty-one trillion, one billion, ten million, one hundred twenty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •