Base | Representation |
---|---|
bin | 1100110011101100000… |
… | …0011110010100011111 |
3 | 210000221111111101021002 |
4 | 3030323000132110133 |
5 | 12101112011441111 |
6 | 245025405300515 |
7 | 21616426202351 |
oct | 3147300362437 |
9 | 700844441232 |
10 | 220033312031 |
11 | 85352083025 |
12 | 3678886473b |
13 | 1799788b470 |
14 | a9149990d1 |
15 | 5acc0c063b |
hex | 333b01e51f |
220033312031 has 8 divisors (see below), whose sum is σ = 236987627184. Its totient is φ = 203083093440.
The previous prime is 220033312019. The next prime is 220033312039. The reversal of 220033312031 is 130213330022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220033312031 - 210 = 220033311007 is a prime.
It is a super-2 number, since 2×2200333120312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220033311994 and 220033312012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220033312039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 912125 + ... + 1127846.
It is an arithmetic number, because the mean of its divisors is an integer number (29623453398).
Almost surely, 2220033312031 is an apocalyptic number.
220033312031 is a deficient number, since it is larger than the sum of its proper divisors (16954315153).
220033312031 is a wasteful number, since it uses less digits than its factorization.
220033312031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2048281.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 220033312031 its reverse (130213330022), we get a palindrome (350246642053).
The spelling of 220033312031 in words is "two hundred twenty billion, thirty-three million, three hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •