Base | Representation |
---|---|
bin | 11011100001000101110001… |
… | …101001001011100011000001 |
3 | 120212111111212111222010211011 |
4 | 123201011301221023203001 |
5 | 111330302404212320001 |
6 | 1105220212151320521 |
7 | 34330331105035216 |
oct | 3341056151134301 |
9 | 525444774863734 |
10 | 121021200120001 |
11 | 356198914a7035 |
12 | 116a6877080141 |
13 | 526b3339070cc |
14 | 21c5658d1db0d |
15 | ded08c198d51 |
hex | 6e1171a4b8c1 |
121021200120001 has 8 divisors (see below), whose sum is σ = 121087733573664. Its totient is φ = 120954678012000.
The previous prime is 121021200119891. The next prime is 121021200120043. The reversal of 121021200120001 is 100021002120121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121021200120001 - 215 = 121021200087233 is a prime.
It is a super-2 number, since 2×1210212001200012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121021200120061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18547206 + ... + 24208288.
It is an arithmetic number, because the mean of its divisors is an integer number (15135966696708).
Almost surely, 2121021200120001 is an apocalyptic number.
It is an amenable number.
121021200120001 is a deficient number, since it is larger than the sum of its proper divisors (66533453663).
121021200120001 is an equidigital number, since it uses as much as digits as its factorization.
121021200120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5672831.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121021200120001 its reverse (100021002120121), we get a palindrome (221042202240122).
The spelling of 121021200120001 in words is "one hundred twenty-one trillion, twenty-one billion, two hundred million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •