Base | Representation |
---|---|
bin | 1010001110110111111100… |
… | …1111010000111011000101 |
3 | 1110211112220102111000202220 |
4 | 2203231333033100323011 |
5 | 2433312314414244013 |
6 | 35532251253522553 |
7 | 2240555460412302 |
oct | 243557717207305 |
9 | 43745812430686 |
10 | 11250654056133 |
11 | 3648414a02218 |
12 | 1318551343459 |
13 | 637c16b571bb |
14 | 2ac76aba20a9 |
15 | 1479c6b1cb23 |
hex | a3b7f3d0ec5 |
11250654056133 has 4 divisors (see below), whose sum is σ = 15000872074848. Its totient is φ = 7500436037420.
The previous prime is 11250654056123. The next prime is 11250654056149. The reversal of 11250654056133 is 33165045605211.
It is a happy number.
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 a cyclic number.
It is not a de Polignac number, because 11250654056133 - 212 = 11250654052037 is a prime.
It is a super-2 number, since 2×112506540561332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11250654056113) 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, 1875109009353 + ... + 1875109009358.
It is an arithmetic number, because the mean of its divisors is an integer number (3750218018712).
Almost surely, 211250654056133 is an apocalyptic number.
It is an amenable number.
11250654056133 is a deficient number, since it is larger than the sum of its proper divisors (3750218018715).
11250654056133 is an equidigital number, since it uses as much as digits as its factorization.
11250654056133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3750218018714.
The product of its (nonzero) digits is 324000, while the sum is 42.
The spelling of 11250654056133 in words is "eleven trillion, two hundred fifty billion, six hundred fifty-four million, fifty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •