Base | Representation |
---|---|
bin | 110010000111010000111011… |
… | …000101011001011111110001 |
3 | 1001220101011212210100001100222 |
4 | 302013100323011121133301 |
5 | 212342024314424014213 |
6 | 2100431022210022425 |
7 | 64265325310653644 |
oct | 6207207305313761 |
9 | 1056334783301328 |
10 | 220401533032433 |
11 | 642548465a4735 |
12 | 20877363577a15 |
13 | 95c9a1069a51c |
14 | 3c5d6c38a5a5b |
15 | 1a7323a1e0808 |
hex | c8743b1597f1 |
220401533032433 has 16 divisors (see below), whose sum is σ = 226712277596160. Its totient is φ = 214163638786896.
The previous prime is 220401533032379. The next prime is 220401533032489. The reversal of 220401533032433 is 334230335104022.
It is a cyclic number.
It is not a de Polignac number, because 220401533032433 - 222 = 220401528838129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220401533032393 and 220401533032402.
It is not an unprimeable number, because it can be changed into a prime (220401533032493) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24941591 + ... + 32601932.
It is an arithmetic number, because the mean of its divisors is an integer number (14169517349760).
Almost surely, 2220401533032433 is an apocalyptic number.
It is an amenable number.
220401533032433 is a deficient number, since it is larger than the sum of its proper divisors (6310744563727).
220401533032433 is a wasteful number, since it uses less digits than its factorization.
220401533032433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57544156.
The product of its (nonzero) digits is 155520, while the sum is 35.
Adding to 220401533032433 its reverse (334230335104022), we get a palindrome (554631868136455).
The spelling of 220401533032433 in words is "two hundred twenty trillion, four hundred one billion, five hundred thirty-three million, thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •