Base | Representation |
---|---|
bin | 1100110100011110100… |
… | …0110100000001111011 |
3 | 210001111021020002011111 |
4 | 3031013220310001323 |
5 | 12102030233311212 |
6 | 245102415141151 |
7 | 21624611265340 |
oct | 3150750640173 |
9 | 701437202144 |
10 | 220245213307 |
11 | 85450754649 |
12 | 368278147b7 |
13 | 179cc751832 |
14 | a934b987c7 |
15 | 5ae09caea7 |
hex | 3347a3407b |
220245213307 has 8 divisors (see below), whose sum is σ = 252003908576. Its totient is φ = 188560291392.
The previous prime is 220245213203. The next prime is 220245213313. The reversal of 220245213307 is 703312542022.
220245213307 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220245213307 is a prime.
It is not an unprimeable number, because it can be changed into a prime (220245213407) 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, 18436938 + ... + 18448879.
It is an arithmetic number, because the mean of its divisors is an integer number (31500488572).
Almost surely, 2220245213307 is an apocalyptic number.
220245213307 is a deficient number, since it is larger than the sum of its proper divisors (31758695269).
220245213307 is an equidigital number, since it uses as much as digits as its factorization.
220245213307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36886677.
The product of its (nonzero) digits is 20160, while the sum is 31.
Adding to 220245213307 its reverse (703312542022), we get a palindrome (923557755329).
The spelling of 220245213307 in words is "two hundred twenty billion, two hundred forty-five million, two hundred thirteen thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •