Base | Representation |
---|---|
bin | 111000011100000110… |
… | …1010100111100000101 |
3 | 102120211210010201110112 |
4 | 1300320031110330011 |
5 | 3441210214231041 |
6 | 131402433402405 |
7 | 11520333604010 |
oct | 1607015247405 |
9 | 376753121415 |
10 | 121202102021 |
11 | 47446477170 |
12 | 1b5a6409405 |
13 | b577266540 |
14 | 5c1ac62377 |
15 | 32457a8deb |
hex | 1c38354f05 |
121202102021 has 32 divisors (see below), whose sum is σ = 172305439488. Its totient is φ = 82050186240.
The previous prime is 121202101973. The next prime is 121202102029. The reversal of 121202102021 is 120201202121.
It is not a de Polignac number, because 121202102021 - 26 = 121202101957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121202101987 and 121202102005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121202102029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3544190 + ... + 3578223.
It is an arithmetic number, because the mean of its divisors is an integer number (5384544984).
Almost surely, 2121202102021 is an apocalyptic number.
121202102021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121202102021 is a deficient number, since it is larger than the sum of its proper divisors (51103337467).
121202102021 is a wasteful number, since it uses less digits than its factorization.
121202102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7122461.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 121202102021 its reverse (120201202121), we get a palindrome (241403304142).
The spelling of 121202102021 in words is "one hundred twenty-one billion, two hundred two million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •