Base | Representation |
---|---|
bin | 10100100000100000… |
… | …10100010100010101 |
3 | 1001102022111121122211 |
4 | 22100100110110111 |
5 | 140022043144341 |
6 | 5020305153421 |
7 | 536561366635 |
oct | 122020242425 |
9 | 31368447584 |
10 | 11010131221 |
11 | 473aa28601 |
12 | 217332b871 |
13 | 1066063b5b |
14 | 76638a6c5 |
15 | 4468e1181 |
hex | 290414515 |
11010131221 has 4 divisors (see below), whose sum is σ = 11073773772. Its totient is φ = 10946488672.
The previous prime is 11010131219. The next prime is 11010131281. The reversal of 11010131221 is 12213101011.
It is a happy number.
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 10330486321 + 679644900 = 101639^2 + 26070^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010131221 - 21 = 11010131219 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010131201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31821016 + ... + 31821361.
It is an arithmetic number, because the mean of its divisors is an integer number (2768443443).
Almost surely, 211010131221 is an apocalyptic number.
It is an amenable number.
11010131221 is a deficient number, since it is larger than the sum of its proper divisors (63642551).
11010131221 is an equidigital number, since it uses as much as digits as its factorization.
11010131221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63642550.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11010131221 its reverse (12213101011), we get a palindrome (23223232232).
The spelling of 11010131221 in words is "eleven billion, ten million, one hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •