Base | Representation |
---|---|
bin | 10010110101010101… |
… | …00100101001111101 |
3 | 222002122201021011022 |
4 | 21122222210221331 |
5 | 131201411403341 |
6 | 4351150433525 |
7 | 505363313015 |
oct | 113252445175 |
9 | 28078637138 |
10 | 10111044221 |
11 | 431946a1a3 |
12 | 1b622028a5 |
13 | c519c9c05 |
14 | 6bcbcac45 |
15 | 3e29e4e4b |
hex | 25aaa4a7d |
10111044221 has 4 divisors (see below), whose sum is σ = 10114031100. Its totient is φ = 10108057344.
The previous prime is 10111044217. The next prime is 10111044233. The reversal of 10111044221 is 12244011101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7236904900 + 2874139321 = 85070^2 + 53611^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111044221 - 22 = 10111044217 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10111044221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111044721) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1488356 + ... + 1495133.
It is an arithmetic number, because the mean of its divisors is an integer number (2528507775).
Almost surely, 210111044221 is an apocalyptic number.
It is an amenable number.
10111044221 is a deficient number, since it is larger than the sum of its proper divisors (2986879).
10111044221 is an equidigital number, since it uses as much as digits as its factorization.
10111044221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2986878.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10111044221 its reverse (12244011101), we get a palindrome (22355055322).
The spelling of 10111044221 in words is "ten billion, one hundred eleven million, forty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •