Base | Representation |
---|---|
bin | 1010001100101011101011… |
… | …1000110101000110100111 |
3 | 1110200221201020220222121121 |
4 | 2203022322320311012213 |
5 | 2432203211011233221 |
6 | 35503103042554411 |
7 | 2235053411162260 |
oct | 243127270650647 |
9 | 43627636828547 |
10 | 11213000102311 |
11 | 3633452265417 |
12 | 13111a3068a07 |
13 | 6344c5b4c657 |
14 | 2aa9d800b967 |
15 | 146a210a0a41 |
hex | a32bae351a7 |
11213000102311 has 8 divisors (see below), whose sum is σ = 12814921109664. Its totient is φ = 9611095057440.
The previous prime is 11213000102281. The next prime is 11213000102327. The reversal of 11213000102311 is 11320100031211.
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 11213000102311 - 25 = 11213000102279 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 (11213000102011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2445460 + ... + 5329753.
It is an arithmetic number, because the mean of its divisors is an integer number (1601865138708).
Almost surely, 211213000102311 is an apocalyptic number.
11213000102311 is a deficient number, since it is larger than the sum of its proper divisors (1601921007353).
11213000102311 is an equidigital number, since it uses as much as digits as its factorization.
11213000102311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7981241.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11213000102311 its reverse (11320100031211), we get a palindrome (22533100133522).
The spelling of 11213000102311 in words is "eleven trillion, two hundred thirteen billion, one hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •