Base | Representation |
---|---|
bin | 11011100000110010001001… |
… | …010011011000010111000101 |
3 | 120212102111110120011222112000 |
4 | 123200302021103120113011 |
5 | 111324431222242101041 |
6 | 1105202404435015513 |
7 | 34325653553620500 |
oct | 3340621123302705 |
9 | 525374416158460 |
10 | 121000122222021 |
11 | 35610955589339 |
12 | 116a277413a599 |
13 | 5269354b19923 |
14 | 21c4619810137 |
15 | dec7569b0bb6 |
hex | 6e0c894d85c5 |
121000122222021 has 96 divisors (see below), whose sum is σ = 211732328263680. Its totient is φ = 68080785407712.
The previous prime is 121000122222017. The next prime is 121000122222041. The reversal of 121000122222021 is 120222221000121.
It is a happy number.
It is not a de Polignac number, because 121000122222021 - 22 = 121000122222017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121000122221985 and 121000122222003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121000122222041) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 200648076 + ... + 201250218.
It is an arithmetic number, because the mean of its divisors is an integer number (2205545086080).
Almost surely, 2121000122222021 is an apocalyptic number.
It is an amenable number.
121000122222021 is a deficient number, since it is larger than the sum of its proper divisors (90732206041659).
121000122222021 is a wasteful number, since it uses less digits than its factorization.
121000122222021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604500 (or 604487 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 121000122222021 its reverse (120222221000121), we get a palindrome (241222343222142).
The spelling of 121000122222021 in words is "one hundred twenty-one trillion, one hundred twenty-two million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •