Base | Representation |
---|---|
bin | 10100111001101001… |
… | …01110001100110101 |
3 | 1001222000021220122010 |
4 | 22130310232030311 |
5 | 140440034013023 |
6 | 5053240554433 |
7 | 545031635445 |
oct | 123464561465 |
9 | 31860256563 |
10 | 11221001013 |
11 | 4838a65162 |
12 | 2211a82a19 |
13 | 109a955891 |
14 | 78639c125 |
15 | 45a196093 |
hex | 29cd2e335 |
11221001013 has 4 divisors (see below), whose sum is σ = 14961334688. Its totient is φ = 7480667340.
The previous prime is 11221000993. The next prime is 11221001017. The reversal of 11221001013 is 31010012211.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31010012211 = 3 ⋅10336670737.
It is not a de Polignac number, because 11221001013 - 210 = 11220999989 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11221001013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11221001017) 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, 1870166833 + ... + 1870166838.
It is an arithmetic number, because the mean of its divisors is an integer number (3740333672).
Almost surely, 211221001013 is an apocalyptic number.
It is an amenable number.
11221001013 is a deficient number, since it is larger than the sum of its proper divisors (3740333675).
11221001013 is an equidigital number, since it uses as much as digits as its factorization.
11221001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3740333674.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 11221001013 its reverse (31010012211), we get a palindrome (42231013224).
The spelling of 11221001013 in words is "eleven billion, two hundred twenty-one million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •