Base | Representation |
---|---|
bin | 111000011100100001… |
… | …0011010111000110010 |
3 | 102120212202022211100220 |
4 | 1300321002122320302 |
5 | 3441222300120033 |
6 | 131404051553510 |
7 | 11520563112162 |
oct | 1607102327062 |
9 | 376782284326 |
10 | 121216020018 |
11 | 47453312a45 |
12 | 1b5aabbb896 |
13 | b57a0ca542 |
14 | 5c1ca465a2 |
15 | 3246b07bb3 |
hex | 1c3909ae32 |
121216020018 has 8 divisors (see below), whose sum is σ = 242432040048. Its totient is φ = 40405340004.
The previous prime is 121216019941. The next prime is 121216020019. The reversal of 121216020018 is 810020612121.
It is a sphenic number, since it is the product of 3 distinct primes.
121216020018 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 121216020018.
It is not an unprimeable number, because it can be changed into a prime (121216020019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10101334996 + ... + 10101335007.
It is an arithmetic number, because the mean of its divisors is an integer number (30304005006).
Almost surely, 2121216020018 is an apocalyptic number.
121216020018 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121216020018 is a wasteful number, since it uses less digits than its factorization.
121216020018 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20202670008.
The product of its (nonzero) digits is 384, while the sum is 24.
Adding to 121216020018 its reverse (810020612121), we get a palindrome (931236632139).
The spelling of 121216020018 in words is "one hundred twenty-one billion, two hundred sixteen million, twenty thousand, eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •