Base | Representation |
---|---|
bin | 10100111000011101… |
… | …00101000010011101 |
3 | 1001221022110220120210 |
4 | 22130032211002131 |
5 | 140430004031023 |
6 | 5052242403033 |
7 | 544550642031 |
oct | 123416450235 |
9 | 31838426523 |
10 | 11211002013 |
11 | 4833355822 |
12 | 220a660479 |
13 | 1098864603 |
14 | 784d181c1 |
15 | 45936d593 |
hex | 29c3a509d |
11211002013 has 4 divisors (see below), whose sum is σ = 14948002688. Its totient is φ = 7474001340.
The previous prime is 11211001973. The next prime is 11211002017. The reversal of 11211002013 is 31020011211.
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 11211002013 - 225 = 11177447581 is a prime.
It is a super-2 number, since 2×112110020132 (a number of 21 digits) contains 22 as substring.
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 11211002013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11211002017) 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, 1868500333 + ... + 1868500338.
It is an arithmetic number, because the mean of its divisors is an integer number (3737000672).
Almost surely, 211211002013 is an apocalyptic number.
It is an amenable number.
11211002013 is a deficient number, since it is larger than the sum of its proper divisors (3737000675).
11211002013 is an equidigital number, since it uses as much as digits as its factorization.
11211002013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3737000674.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 11211002013 its reverse (31020011211), we get a palindrome (42231013224).
The spelling of 11211002013 in words is "eleven billion, two hundred eleven million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •