Base | Representation |
---|---|
bin | 1100110011101011010… |
… | …0010110010001000001 |
3 | 210000221021111212212210 |
4 | 3030322310112101001 |
5 | 12101110203231223 |
6 | 245025213212333 |
7 | 21616360163064 |
oct | 3147264262101 |
9 | 700837455783 |
10 | 220030133313 |
11 | 85350301891 |
12 | 367877910a9 |
13 | 17997017673 |
14 | a9143ac8db |
15 | 5acbb93893 |
hex | 333ad16441 |
220030133313 has 8 divisors (see below), whose sum is σ = 293379393376. Its totient is φ = 146683814400.
The previous prime is 220030133303. The next prime is 220030133317. The reversal of 220030133313 is 313331030022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220030133313 - 221 = 220028036161 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 220030133313.
It is not an unprimeable number, because it can be changed into a prime (220030133317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 554368 + ... + 864513.
It is an arithmetic number, because the mean of its divisors is an integer number (36672424172).
Almost surely, 2220030133313 is an apocalyptic number.
It is an amenable number.
220030133313 is a deficient number, since it is larger than the sum of its proper divisors (73349260063).
220030133313 is a wasteful number, since it uses less digits than its factorization.
220030133313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1470575.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 220030133313 its reverse (313331030022), we get a palindrome (533361163335).
The spelling of 220030133313 in words is "two hundred twenty billion, thirty million, one hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •