Base | Representation |
---|---|
bin | 11011100001000100110000… |
… | …000100111110111010000001 |
3 | 120212111102000212002221112010 |
4 | 123201010300010332322001 |
5 | 111330243131112041001 |
6 | 1105215511054323133 |
7 | 34330261620106626 |
oct | 3341046004767201 |
9 | 525442025087463 |
10 | 121020100112001 |
11 | 35619377586812 |
12 | 116a660a7b94a9 |
13 | 526b1b9a528bc |
14 | 21c5592bbc34d |
15 | ded0258108d6 |
hex | 6e113013ee81 |
121020100112001 has 8 divisors (see below), whose sum is σ = 170851906040544. Its totient is φ = 75934180462400.
The previous prime is 121020100111903. The next prime is 121020100112047. The reversal of 121020100112001 is 100211001020121.
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 121020100112001 - 27 = 121020100111873 is a prime.
It is a super-2 number, since 2×1210201001120012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121020100112501) 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, 1186471569675 + ... + 1186471569776.
It is an arithmetic number, because the mean of its divisors is an integer number (21356488255068).
Almost surely, 2121020100112001 is an apocalyptic number.
It is an amenable number.
121020100112001 is a deficient number, since it is larger than the sum of its proper divisors (49831805928543).
121020100112001 is a wasteful number, since it uses less digits than its factorization.
121020100112001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2372943139471.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 121020100112001 its reverse (100211001020121), we get a palindrome (221231101132122).
The spelling of 121020100112001 in words is "one hundred twenty-one trillion, twenty billion, one hundred million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •