Base | Representation |
---|---|
bin | 1100110101001001001… |
… | …1101001001110111001 |
3 | 210001221202001020011210 |
4 | 3031102103221032321 |
5 | 12102412044312213 |
6 | 245132251513333 |
7 | 21632213620524 |
oct | 3152223511671 |
9 | 701852036153 |
10 | 220424213433 |
11 | 855327a4036 |
12 | 36877758849 |
13 | 17a2a865578 |
14 | a950871bbb |
15 | 5b015880c3 |
hex | 33524e93b9 |
220424213433 has 4 divisors (see below), whose sum is σ = 293898951248. Its totient is φ = 146949475620.
The previous prime is 220424213423. The next prime is 220424213441. The reversal of 220424213433 is 334312424022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 220424213433 - 222 = 220420019129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 220424213433.
It is not an unprimeable number, because it can be changed into a prime (220424213423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36737368903 + ... + 36737368908.
It is an arithmetic number, because the mean of its divisors is an integer number (73474737812).
Almost surely, 2220424213433 is an apocalyptic number.
It is an amenable number.
220424213433 is a deficient number, since it is larger than the sum of its proper divisors (73474737815).
220424213433 is an equidigital number, since it uses as much as digits as its factorization.
220424213433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73474737814.
The product of its (nonzero) digits is 27648, while the sum is 30.
Adding to 220424213433 its reverse (334312424022), we get a palindrome (554736637455).
The spelling of 220424213433 in words is "two hundred twenty billion, four hundred twenty-four million, two hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •