Base | Representation |
---|---|
bin | 10010101111011000… |
… | …011110111011011001 |
3 | 1220221100122202110212 |
4 | 102233120132323121 |
5 | 312202302100441 |
6 | 13124414420505 |
7 | 1311435505010 |
oct | 225730367331 |
9 | 56840582425 |
10 | 20122300121 |
11 | 8596571a00 |
12 | 3a96b01735 |
13 | 1b88b28781 |
14 | d8c63da77 |
15 | 7cb877eeb |
hex | 4af61eed9 |
20122300121 has 48 divisors (see below), whose sum is σ = 27042317568. Its totient is φ = 14604226560.
The previous prime is 20122300073. The next prime is 20122300123. The reversal of 20122300121 is 12100322102.
It is a happy number.
It is not a de Polignac number, because 20122300121 - 226 = 20055191257 is a prime.
It is a super-2 number, since 2×201223001212 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20122300096 and 20122300105.
It is not an unprimeable number, because it can be changed into a prime (20122300123) 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, 1389500 + ... + 1403906.
It is an arithmetic number, because the mean of its divisors is an integer number (563381616).
Almost surely, 220122300121 is an apocalyptic number.
It is an amenable number.
20122300121 is a deficient number, since it is larger than the sum of its proper divisors (6920017447).
20122300121 is a wasteful number, since it uses less digits than its factorization.
20122300121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14550 (or 14539 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 20122300121 its reverse (12100322102), we get a palindrome (32222622223).
It can be divided in two parts, 201 and 22300121, that added together give a palindrome (22300322).
The spelling of 20122300121 in words is "twenty billion, one hundred twenty-two million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •