Base | Representation |
---|---|
bin | 11011100010100001110100… |
… | …011111101001010101000001 |
3 | 120212211221222021222000000120 |
4 | 123202201310133221111001 |
5 | 111333412311220400001 |
6 | 1105333435154010453 |
7 | 34340430210616152 |
oct | 3342416437512501 |
9 | 525757867860016 |
10 | 121120032200001 |
11 | 3565779864759a |
12 | 11701a59876a29 |
13 | 5277754475013 |
14 | 21ca352c01929 |
15 | e00923ad3236 |
hex | 6e28747e9541 |
121120032200001 has 8 divisors (see below), whose sum is σ = 161494684854624. Its totient is φ = 80746033839360.
The previous prime is 121120032199997. The next prime is 121120032200023. The reversal of 121120032200001 is 100002230021121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121120032200001 - 22 = 121120032199997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (121120032200081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 163141395 + ... + 163882136.
It is an arithmetic number, because the mean of its divisors is an integer number (20186835606828).
Almost surely, 2121120032200001 is an apocalyptic number.
It is an amenable number.
121120032200001 is a deficient number, since it is larger than the sum of its proper divisors (40374652654623).
121120032200001 is a wasteful number, since it uses less digits than its factorization.
121120032200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327146991.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 121120032200001 its reverse (100002230021121), we get a palindrome (221122262221122).
The spelling of 121120032200001 in words is "one hundred twenty-one trillion, one hundred twenty billion, thirty-two million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •