Base | Representation |
---|---|
bin | 11010010110001… |
… | …01110001000101 |
3 | 120101212112010002 |
4 | 31023011301011 |
5 | 423034323023 |
6 | 33533011045 |
7 | 5322363656 |
oct | 1513056105 |
9 | 511775102 |
10 | 221011013 |
11 | 103833933 |
12 | 62023a85 |
13 | 36a32962 |
14 | 214d152d |
15 | 14609b28 |
hex | d2c5c45 |
221011013 has 4 divisors (see below), whose sum is σ = 226150848. Its totient is φ = 215871180.
The previous prime is 221010971. The next prime is 221011057. The reversal of 221011013 is 310110122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 221011013 - 26 = 221010949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221010985 and 221011003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221011073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2569853 + ... + 2569938.
It is an arithmetic number, because the mean of its divisors is an integer number (56537712).
Almost surely, 2221011013 is an apocalyptic number.
It is an amenable number.
221011013 is a deficient number, since it is larger than the sum of its proper divisors (5139835).
221011013 is an equidigital number, since it uses as much as digits as its factorization.
221011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5139834.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 221011013 is about 14866.4391499780. The cubic root of 221011013 is about 604.6044022665.
Adding to 221011013 its reverse (310110122), we get a palindrome (531121135).
The spelling of 221011013 in words is "two hundred twenty-one million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •