Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …01011011100111110011001 |
3 | 2121220002210121120202220221 |
4 | 10203113020023130332121 |
5 | 10111020431424341441 |
6 | 110330023330520041 |
7 | 4134361543351510 |
oct | 443271013347631 |
9 | 77802717522827 |
10 | 20022201012121 |
11 | 641a405548040 |
12 | 22b452a736021 |
13 | b231159858b9 |
14 | 4d31189a5677 |
15 | 24ac53e6d8d1 |
hex | 1235c82dcf99 |
20022201012121 has 16 divisors (see below), whose sum is σ = 24974637004800. Its totient is φ = 15594282020880.
The previous prime is 20022201012103. The next prime is 20022201012157. The reversal of 20022201012121 is 12121010222002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20022201012121 - 27 = 20022201011993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20022201012095 and 20022201012104.
It is not an unprimeable number, because it can be changed into a prime (20022201012161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61779441 + ... + 62102686.
It is an arithmetic number, because the mean of its divisors is an integer number (1560914812800).
Almost surely, 220022201012121 is an apocalyptic number.
It is an amenable number.
20022201012121 is a deficient number, since it is larger than the sum of its proper divisors (4952435992679).
20022201012121 is a wasteful number, since it uses less digits than its factorization.
20022201012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123884244.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20022201012121 its reverse (12121010222002), we get a palindrome (32143211234123).
The spelling of 20022201012121 in words is "twenty trillion, twenty-two billion, two hundred one million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •