Base | Representation |
---|---|
bin | 1100110111010010100… |
… | …0100000111110110001 |
3 | 210010102212200210202022 |
4 | 3031310220200332301 |
5 | 12110102012010001 |
6 | 245305343201225 |
7 | 21652405640336 |
oct | 3156450407661 |
9 | 703385623668 |
10 | 221000110001 |
11 | 857a8889710 |
12 | 369b85a6215 |
13 | 17abcc72078 |
14 | a9a714298d |
15 | 5b36de411b |
hex | 3374a20fb1 |
221000110001 has 16 divisors (see below), whose sum is σ = 243519490368. Its totient is φ = 198886152000.
The previous prime is 221000109997. The next prime is 221000110027. The reversal of 221000110001 is 100011000122.
221000110001 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 221000110001 - 22 = 221000109997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (221000110061) 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 15 ways as a sum of consecutive naturals, for example, 8400470 + ... + 8426736.
It is an arithmetic number, because the mean of its divisors is an integer number (15219968148).
Almost surely, 2221000110001 is an apocalyptic number.
It is an amenable number.
221000110001 is a deficient number, since it is larger than the sum of its proper divisors (22519380367).
221000110001 is a wasteful number, since it uses less digits than its factorization.
221000110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33952.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 221000110001 its reverse (100011000122), we get a palindrome (321011110123).
It can be divided in two parts, 22 and 1000110001, that multiplied together give a palindrome (22002420022).
The spelling of 221000110001 in words is "two hundred twenty-one billion, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •