Base | Representation |
---|---|
bin | 1100110110000001101… |
… | …0111011100010010001 |
3 | 210002120020121110100211 |
4 | 3031200122323202101 |
5 | 12103403204120213 |
6 | 245211551044121 |
7 | 21641120406352 |
oct | 3154032734221 |
9 | 702506543324 |
10 | 220661004433 |
11 | 85644425681 |
12 | 36922b10641 |
13 | 17a6793189c |
14 | a9740add29 |
15 | 5b1725d53d |
hex | 33606bb891 |
220661004433 has 4 divisors (see below), whose sum is σ = 220662164260. Its totient is φ = 220659844608.
The previous prime is 220661004407. The next prime is 220661004451. The reversal of 220661004433 is 334400166022.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 41480654224 + 179180350209 = 203668^2 + 423297^2 .
It is a cyclic number.
It is not a de Polignac number, because 220661004433 - 233 = 212071069841 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220661004395 and 220661004404.
It is not an unprimeable number, because it can be changed into a prime (220661004493) 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, 220128 + ... + 699841.
It is an arithmetic number, because the mean of its divisors is an integer number (55165541065).
Almost surely, 2220661004433 is an apocalyptic number.
It is an amenable number.
220661004433 is a deficient number, since it is larger than the sum of its proper divisors (1159827).
220661004433 is an equidigital number, since it uses as much as digits as its factorization.
220661004433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1159826.
The product of its (nonzero) digits is 20736, while the sum is 31.
The spelling of 220661004433 in words is "two hundred twenty billion, six hundred sixty-one million, four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •