Base | Representation |
---|---|
bin | 11101011011001110101… |
… | …011011011111010001001 |
3 | 21011022101202212222122200 |
4 | 131123032223123322021 |
5 | 231112231120401441 |
6 | 4144535122110413 |
7 | 266043401304624 |
oct | 35331653337211 |
9 | 7138352788580 |
10 | 2022102122121 |
11 | 70a628a28314 |
12 | 287a91aab409 |
13 | 1188b65c0a43 |
14 | 6dc28014dbb |
15 | 378ed57e7b6 |
hex | 1d6ceadbe89 |
2022102122121 has 48 divisors (see below), whose sum is σ = 3002395171776. Its totient is φ = 1310714431488.
The previous prime is 2022102122099. The next prime is 2022102122153. The reversal of 2022102122121 is 1212212012202.
It is a happy number.
2022102122121 is a `hidden beast` number, since 20 + 221 + 0 + 212 + 212 + 1 = 666.
It is not a de Polignac number, because 2022102122121 - 27 = 2022102121993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2022102122094 and 2022102122103.
It is not an unprimeable number, because it can be changed into a prime (2022102122171) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 83847361 + ... + 83871473.
It is an arithmetic number, because the mean of its divisors is an integer number (62549899412).
Almost surely, 22022102122121 is an apocalyptic number.
It is an amenable number.
2022102122121 is a deficient number, since it is larger than the sum of its proper divisors (980293049655).
2022102122121 is a wasteful number, since it uses less digits than its factorization.
2022102122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25142 (or 25139 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2022102122121 its reverse (1212212012202), we get a palindrome (3234314134323).
The spelling of 2022102122121 in words is "two trillion, twenty-two billion, one hundred two million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •