Base | Representation |
---|---|
bin | 1100111001000100111… |
… | …1110100000111010001 |
3 | 210011200100000120210122 |
4 | 3032101033310013101 |
5 | 12112042411032113 |
6 | 245425132440025 |
7 | 22000325263046 |
oct | 3162117640721 |
9 | 704610016718 |
10 | 221480174033 |
11 | 85a24869948 |
12 | 36b11319015 |
13 | 17b68566c21 |
14 | aa10bc91cd |
15 | 5b64120408 |
hex | 33913f41d1 |
221480174033 has 32 divisors (see below), whose sum is σ = 232380825600. Its totient is φ = 210852849600.
The previous prime is 221480174023. The next prime is 221480174059. The reversal of 221480174033 is 330471084122.
221480174033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 221480174033 - 24 = 221480174017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 221480173984 and 221480174002.
It is not an unprimeable number, because it can be changed into a prime (221480174023) 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 31 ways as a sum of consecutive naturals, for example, 361305035 + ... + 361305647.
It is an arithmetic number, because the mean of its divisors is an integer number (7261900800).
Almost surely, 2221480174033 is an apocalyptic number.
It is an amenable number.
221480174033 is a deficient number, since it is larger than the sum of its proper divisors (10900651567).
221480174033 is a wasteful number, since it uses less digits than its factorization.
221480174033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413.
The product of its (nonzero) digits is 32256, while the sum is 35.
The spelling of 221480174033 in words is "two hundred twenty-one billion, four hundred eighty million, one hundred seventy-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •