Base | Representation |
---|---|
bin | 100000000010111110000… |
… | …100001001000001011001 |
3 | 21210112021221102101122100 |
4 | 200002332010021001121 |
5 | 242040112233341441 |
6 | 4403403210114013 |
7 | 315050603151012 |
oct | 40027604110131 |
9 | 7715257371570 |
10 | 2202212012121 |
11 | 779a532a6480 |
12 | 2b697841b909 |
13 | 12c88ac2c554 |
14 | 78832658009 |
15 | 3c440742cb6 |
hex | 200be109059 |
2202212012121 has 24 divisors (see below), whose sum is σ = 3471423340320. Its totient is φ = 1334185070400.
The previous prime is 2202212012113. The next prime is 2202212012153. The reversal of 2202212012121 is 1212102122022.
It is a happy number.
2202212012121 is a `hidden beast` number, since 220 + 221 + 201 + 2 + 1 + 21 = 666.
It is not a de Polignac number, because 2202212012121 - 23 = 2202212012113 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2202212012094 and 2202212012103.
It is not an unprimeable number, because it can be changed into a prime (2202212012321) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3802236 + ... + 4342973.
It is an arithmetic number, because the mean of its divisors is an integer number (144642639180).
Almost surely, 22202212012121 is an apocalyptic number.
It is an amenable number.
2202212012121 is a deficient number, since it is larger than the sum of its proper divisors (1269211328199).
2202212012121 is a wasteful number, since it uses less digits than its factorization.
2202212012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8147957 (or 8147954 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2202212012121 its reverse (1212102122022), we get a palindrome (3414314134143).
The spelling of 2202212012121 in words is "two trillion, two hundred two billion, two hundred twelve million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •