Base | Representation |
---|---|
bin | 10101000011001011… |
… | …11011101100101101 |
3 | 1002011120211210122010 |
4 | 22201211323230231 |
5 | 141121024311341 |
6 | 5105215511433 |
7 | 550023000444 |
oct | 124145735455 |
9 | 32146753563 |
10 | 11301010221 |
11 | 487a142276 |
12 | 2234828579 |
13 | 10b13ba1c7 |
14 | 792c67d5b |
15 | 4621ec716 |
hex | 2a197bb2d |
11301010221 has 4 divisors (see below), whose sum is σ = 15068013632. Its totient is φ = 7534006812.
The previous prime is 11301010211. The next prime is 11301010241. The reversal of 11301010221 is 12201010311.
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 11301010221 - 27 = 11301010093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11301010197 and 11301010206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11301010211) 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 3 ways as a sum of consecutive naturals, for example, 1883501701 + ... + 1883501706.
It is an arithmetic number, because the mean of its divisors is an integer number (3767003408).
Almost surely, 211301010221 is an apocalyptic number.
It is an amenable number.
11301010221 is a deficient number, since it is larger than the sum of its proper divisors (3767003411).
11301010221 is an equidigital number, since it uses as much as digits as its factorization.
11301010221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3767003410.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 11301010221 its reverse (12201010311), we get a palindrome (23502020532).
The spelling of 11301010221 in words is "eleven billion, three hundred one million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •