Base | Representation |
---|---|
bin | 111000011001000101… |
… | …1101110101101110101 |
3 | 102120120201221020000202 |
4 | 1300302023232231311 |
5 | 3441003330120041 |
6 | 131344423050245 |
7 | 11514665454212 |
oct | 1606213565565 |
9 | 376521836022 |
10 | 121101020021 |
11 | 473a4406823 |
12 | 1b5785a0985 |
13 | b55c3343c7 |
14 | 5c0b66cb09 |
15 | 323b98da9b |
hex | 1c322eeb75 |
121101020021 has 8 divisors (see below), whose sum is σ = 128454825240. Its totient is φ = 113772794368.
The previous prime is 121101019981. The next prime is 121101020023. The reversal of 121101020021 is 120020101121.
It can be written as a sum of positive squares in 4 ways, for example, as 265527025 + 120835492996 = 16295^2 + 347614^2 .
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 121101020021 - 214 = 121101003637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121101019984 and 121101020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121101020023) 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, 6385136 + ... + 6404073.
It is an arithmetic number, because the mean of its divisors is an integer number (16056853155).
Almost surely, 2121101020021 is an apocalyptic number.
It is an amenable number.
121101020021 is a deficient number, since it is larger than the sum of its proper divisors (7353805219).
121101020021 is a wasteful number, since it uses less digits than its factorization.
121101020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12789783.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 121101020021 its reverse (120020101121), we get a palindrome (241121121142).
The spelling of 121101020021 in words is "one hundred twenty-one billion, one hundred one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •