Base | Representation |
---|---|
bin | 11011100011110110100010… |
… | …101010000111111100100001 |
3 | 120220011122210001211110100211 |
4 | 123203312202222013330201 |
5 | 111341410112224341001 |
6 | 1105443322023214121 |
7 | 34350130413016405 |
oct | 3343664252077441 |
9 | 526148701743324 |
10 | 121211001012001 |
11 | 3569232a11a45a |
12 | 11717606ba7341 |
13 | 52831c0c04824 |
14 | 21d090264d105 |
15 | e02e9a030351 |
hex | 6e3da2a87f21 |
121211001012001 has 8 divisors (see below), whose sum is σ = 125391360124800. Its totient is φ = 117030686527440.
The previous prime is 121211001011987. The next prime is 121211001012119. The reversal of 121211001012001 is 100210100112121.
It is a happy number.
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 121211001012001 - 219 = 121211000487713 is a prime.
It is a super-2 number, since 2×1212110010120012 (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 (121211001012301) 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, 5584171 + ... + 16541008.
It is an arithmetic number, because the mean of its divisors is an integer number (15673920015600).
Almost surely, 2121211001012001 is an apocalyptic number.
It is an amenable number.
121211001012001 is a deficient number, since it is larger than the sum of its proper divisors (4180359112799).
121211001012001 is a wasteful number, since it uses less digits than its factorization.
121211001012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22314119.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 121211001012001 its reverse (100210100112121), we get a palindrome (221421101124122).
The spelling of 121211001012001 in words is "one hundred twenty-one trillion, two hundred eleven billion, one million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •