Base | Representation |
---|---|
bin | 1100110100101110101… |
… | …1111001010011111001 |
3 | 210001200000000121200012 |
4 | 3031023223321103321 |
5 | 12102200130131413 |
6 | 245113242551305 |
7 | 21626364465020 |
oct | 3151353712371 |
9 | 701600017605 |
10 | 220313130233 |
11 | 85486022639 |
12 | 36846508535 |
13 | 17a10841171 |
14 | a93dbd78b7 |
15 | 5ae69447a8 |
hex | 334baf94f9 |
220313130233 has 8 divisors (see below), whose sum is σ = 265038352320. Its totient is φ = 178900887600.
The previous prime is 220313130217. The next prime is 220313130263. The reversal of 220313130233 is 332031313022.
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 220313130233 - 24 = 220313130217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220313130199 and 220313130208.
It is not an unprimeable number, because it can be changed into a prime (220313130263) 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 7 ways as a sum of consecutive naturals, for example, 828244718 + ... + 828244983.
It is an arithmetic number, because the mean of its divisors is an integer number (33129794040).
Almost surely, 2220313130233 is an apocalyptic number.
It is an amenable number.
220313130233 is a deficient number, since it is larger than the sum of its proper divisors (44725222087).
220313130233 is a wasteful number, since it uses less digits than its factorization.
220313130233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1656489727.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 220313130233 its reverse (332031313022), we get a palindrome (552344443255).
The spelling of 220313130233 in words is "two hundred twenty billion, three hundred thirteen million, one hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •