Base | Representation |
---|---|
bin | 11011100000110011111111… |
… | …010100011001101010111101 |
3 | 120212102200120112212100002120 |
4 | 123200303333110121222331 |
5 | 111324444301130413041 |
6 | 1105203333124513153 |
7 | 34326053615305146 |
oct | 3340637724315275 |
9 | 525380515770076 |
10 | 121002102201021 |
11 | 356117811a0918 |
12 | 116a302724b7b9 |
13 | 52695ac0a4132 |
14 | 21c4766776acd |
15 | dec82071b366 |
hex | 6e0cff519abd |
121002102201021 has 8 divisors (see below), whose sum is σ = 161337729754560. Its totient is φ = 80667271390752.
The previous prime is 121002102201011. The next prime is 121002102201041. The reversal of 121002102201021 is 120102201200121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121002102201021 - 231 = 120999954717373 is a prime.
It is a super-2 number, since 2×1210021022010212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121002102201011) 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, 198831361 + ... + 199438998.
It is an arithmetic number, because the mean of its divisors is an integer number (20167216219320).
Almost surely, 2121002102201021 is an apocalyptic number.
It is an amenable number.
121002102201021 is a deficient number, since it is larger than the sum of its proper divisors (40335627553539).
121002102201021 is a wasteful number, since it uses less digits than its factorization.
121002102201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 398371635.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121002102201021 its reverse (120102201200121), we get a palindrome (241104303401142).
The spelling of 121002102201021 in words is "one hundred twenty-one trillion, two billion, one hundred two million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •