Base | Representation |
---|---|
bin | 10100100001110100… |
… | …01010100010011101 |
3 | 1001110002010221122211 |
4 | 22100322022202131 |
5 | 140032400214323 |
6 | 5021340240421 |
7 | 540053546263 |
oct | 122072124235 |
9 | 31402127584 |
10 | 11021101213 |
11 | 4746140511 |
12 | 2176b40111 |
13 | 1068405085 |
14 | 767a04433 |
15 | 44785b70d |
hex | 290e8a89d |
11021101213 has 8 divisors (see below), whose sum is σ = 11073336032. Its totient is φ = 10968956496.
The previous prime is 11021101211. The next prime is 11021101219. The reversal of 11021101213 is 31210112011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11021101213 - 21 = 11021101211 is a prime.
It is a super-3 number, since 3×110211012133 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11021101193 and 11021101202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021101211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 229306 + ... + 273172.
It is an arithmetic number, because the mean of its divisors is an integer number (1384167004).
Almost surely, 211021101213 is an apocalyptic number.
It is an amenable number.
11021101213 is a deficient number, since it is larger than the sum of its proper divisors (52234819).
11021101213 is an equidigital number, since it uses as much as digits as its factorization.
11021101213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45051.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11021101213 its reverse (31210112011), we get a palindrome (42231213224).
The spelling of 11021101213 in words is "eleven billion, twenty-one million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •