Base | Representation |
---|---|
bin | 11011100000110011000100… |
… | …110010010111100100101001 |
3 | 120212102121001010001120022110 |
4 | 123200303010302113210221 |
5 | 111324440243232413001 |
6 | 1105203051445112533 |
7 | 34326020362403265 |
oct | 3340630462274451 |
9 | 525377033046273 |
10 | 121001120201001 |
11 | 35611317951757 |
12 | 116a29b23b8749 |
13 | 52694837c9c31 |
14 | 21c46b21930a5 |
15 | dec7b43e33d6 |
hex | 6e0cc4c97929 |
121001120201001 has 32 divisors (see below), whose sum is σ = 174820707993600. Its totient is φ = 74183786159040.
The previous prime is 121001120200999. The next prime is 121001120201009. The reversal of 121001120201001 is 100102021100121.
It is not a de Polignac number, because 121001120201001 - 21 = 121001120200999 is a prime.
It is a super-3 number, since 3×1210011202010013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (121001120201009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 65649831 + ... + 67467788.
It is an arithmetic number, because the mean of its divisors is an integer number (5463147124800).
Almost surely, 2121001120201001 is an apocalyptic number.
It is an amenable number.
121001120201001 is a deficient number, since it is larger than the sum of its proper divisors (53819587792599).
121001120201001 is a wasteful number, since it uses less digits than its factorization.
121001120201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133118109.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 121001120201001 its reverse (100102021100121), we get a palindrome (221103141301122).
It can be divided in two parts, 121001120 and 201001, that added together give a palindrome (121202121).
The spelling of 121001120201001 in words is "one hundred twenty-one trillion, one billion, one hundred twenty million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •