Base | Representation |
---|---|
bin | 1001000110000111001011… |
… | …01000000101110100011001 |
3 | 2121211002122102112012212210 |
4 | 10203003211220011310121 |
5 | 10110144444334102413 |
6 | 110312233403425333 |
7 | 4133016611523045 |
oct | 443034550056431 |
9 | 77732572465783 |
10 | 20001220222233 |
11 | 6411519426068 |
12 | 22b0454225249 |
13 | b21151038823 |
14 | 4d20c8333025 |
15 | 24a4270683c3 |
hex | 1230e5a05d19 |
20001220222233 has 8 divisors (see below), whose sum is σ = 27288486504928. Its totient is φ = 13024050377184.
The previous prime is 20001220222201. The next prime is 20001220222241. The reversal of 20001220222233 is 33222202210002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20001220222233 - 25 = 20001220222201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20001220222133) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 77524109260 + ... + 77524109517.
It is an arithmetic number, because the mean of its divisors is an integer number (3411060813116).
Almost surely, 220001220222233 is an apocalyptic number.
It is an amenable number.
20001220222233 is a deficient number, since it is larger than the sum of its proper divisors (7287266282695).
20001220222233 is a wasteful number, since it uses less digits than its factorization.
20001220222233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155048218823.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 20001220222233 its reverse (33222202210002), we get a palindrome (53223422432235).
The spelling of 20001220222233 in words is "twenty trillion, one billion, two hundred twenty million, two hundred twenty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •