Base | Representation |
---|---|
bin | 11011100000110011111001… |
… | …010010011011100001001001 |
3 | 120212102200022111110212012102 |
4 | 123200303321102123201021 |
5 | 111324444044230133001 |
6 | 1105203315112123145 |
7 | 34326051246266522 |
oct | 3340637122334111 |
9 | 525380274425172 |
10 | 121002001021001 |
11 | 3561172a073871 |
12 | 116a2bb93964b5 |
13 | 52695941394b9 |
14 | 21c4757159849 |
15 | dec8168d1e6b |
hex | 6e0cf949b849 |
121002001021001 has 8 divisors (see below), whose sum is σ = 121246013419200. Its totient is φ = 120758206786672.
The previous prime is 121002001020911. The next prime is 121002001021039. The reversal of 121002001021001 is 100120100200121.
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 121002001021001 - 214 = 121002001004617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121002001021901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53430551 + ... + 55649148.
It is an arithmetic number, because the mean of its divisors is an integer number (15155751677400).
Almost surely, 2121002001021001 is an apocalyptic number.
It is an amenable number.
121002001021001 is a deficient number, since it is larger than the sum of its proper divisors (244012398199).
121002001021001 is a wasteful number, since it uses less digits than its factorization.
121002001021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109081935.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 121002001021001 its reverse (100120100200121), we get a palindrome (221122101221122).
The spelling of 121002001021001 in words is "one hundred twenty-one trillion, two billion, one million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •