Base | Representation |
---|---|
bin | 1001001001010101111010… |
… | …01000100111101010110011 |
3 | 2122012201010111102210211011 |
4 | 10210222331020213222303 |
5 | 10114004301232031311 |
6 | 110435231032331351 |
7 | 4144026212410123 |
oct | 444527510475263 |
9 | 78181114383734 |
10 | 20112210033331 |
11 | 64545a426a979 |
12 | 2309a6a543b57 |
13 | b2b75b616070 |
14 | 4d7616b70c83 |
15 | 24d270ecd321 |
hex | 124abd227ab3 |
20112210033331 has 16 divisors (see below), whose sum is σ = 21867827756544. Its totient is φ = 18386634921984.
The previous prime is 20112210033241. The next prime is 20112210033337. The reversal of 20112210033331 is 13333001221102.
It is a cyclic number.
It is not a de Polignac number, because 20112210033331 - 29 = 20112210032819 is a prime.
It is a super-2 number, since 2×201122100333312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20112210033337) 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, 3372691 + ... + 7183276.
It is an arithmetic number, because the mean of its divisors is an integer number (1366739234784).
Almost surely, 220112210033331 is an apocalyptic number.
20112210033331 is a deficient number, since it is larger than the sum of its proper divisors (1755617723213).
20112210033331 is a wasteful number, since it uses less digits than its factorization.
20112210033331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10557390.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 20112210033331 its reverse (13333001221102), we get a palindrome (33445211254433).
The spelling of 20112210033331 in words is "twenty trillion, one hundred twelve billion, two hundred ten million, thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •