Base | Representation |
---|---|
bin | 1001001100010000001011… |
… | …00110101011100110100010 |
3 | 2122120021020200020121111101 |
4 | 10212020011212223212202 |
5 | 10122124101242333442 |
6 | 110553210001305014 |
7 | 4154166260212435 |
oct | 446100546534642 |
9 | 78507220217441 |
10 | 20212210121122 |
11 | 6492a4a755a28 |
12 | 232531833516a |
13 | b38007156746 |
14 | 4dc3c1c1581c |
15 | 250b75233cb7 |
hex | 1262059ab9a2 |
20212210121122 has 8 divisors (see below), whose sum is σ = 30334263801372. Its totient is φ = 10100788854000.
The previous prime is 20212210121087. The next prime is 20212210121137. The reversal of 20212210121122 is 22112101221202.
It can be written as a sum of positive squares in 2 ways, for example, as 19480844791521 + 731365329601 = 4413711^2 + 855199^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×202122101211222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20212210121122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2658098529 + ... + 2658106132.
Almost surely, 220212210121122 is an apocalyptic number.
20212210121122 is a deficient number, since it is larger than the sum of its proper divisors (10122053680250).
20212210121122 is a wasteful number, since it uses less digits than its factorization.
20212210121122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5316206564.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 20212210121122 its reverse (22112101221202), we get a palindrome (42324311342324).
The spelling of 20212210121122 in words is "twenty trillion, two hundred twelve billion, two hundred ten million, one hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •