Base | Representation |
---|---|
bin | 1100110111010100111… |
… | …0100111111110010001 |
3 | 210010110120111100121110 |
4 | 3031311032213332101 |
5 | 12110112041200423 |
6 | 245310341243533 |
7 | 21652556566125 |
oct | 3156516477621 |
9 | 703416440543 |
10 | 221010100113 |
11 | 85803492400 |
12 | 369bba035a9 |
13 | 17ac205c28a |
14 | a9a85c3585 |
15 | 5b37c19193 |
hex | 33753a7f91 |
221010100113 has 96 divisors (see below), whose sum is σ = 338107262976. Its totient is φ = 128208960000.
The previous prime is 221010100099. The next prime is 221010100211. The reversal of 221010100113 is 311001010122.
It is not a de Polignac number, because 221010100113 - 217 = 221009969041 is a prime.
It is a super-2 number, since 2×2210101001132 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (221010100313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 259096995 + ... + 259097847.
It is an arithmetic number, because the mean of its divisors is an integer number (3521950656).
Almost surely, 2221010100113 is an apocalyptic number.
It is an amenable number.
221010100113 is a deficient number, since it is larger than the sum of its proper divisors (117097162863).
221010100113 is a wasteful number, since it uses less digits than its factorization.
221010100113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1207 (or 1196 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 221010100113 its reverse (311001010122), we get a palindrome (532011110235).
It can be divided in two parts, 221010 and 100113, that added together give a palindrome (321123).
The spelling of 221010100113 in words is "two hundred twenty-one billion, ten million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.986 sec. • engine limits •