Base | Representation |
---|---|
bin | 1010001000000010111100… |
… | …0110110110100110011001 |
3 | 1110102100002222211211012122 |
4 | 2202000233012312212121 |
5 | 2424402042430310024 |
6 | 35402331025351025 |
7 | 2226233452544003 |
oct | 242005706664631 |
9 | 43370088754178 |
10 | 11133345556889 |
11 | 3602697359496 |
12 | 12b9872a98475 |
13 | 629b4046bb3a |
14 | 2a6bdd0b9373 |
15 | 14490d0bdd5e |
hex | a202f1b6999 |
11133345556889 has 8 divisors (see below), whose sum is σ = 11789361681480. Its totient is φ = 10477453148416.
The previous prime is 11133345556877. The next prime is 11133345556897. The reversal of 11133345556889 is 98865554333111.
It can be written as a sum of positive squares in 4 ways, for example, as 584276784400 + 10549068772489 = 764380^2 + 3247933^2 .
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 11133345556889 - 232 = 11129050589593 is a prime.
It is a Duffinian number.
It is a plaindrome in base 10.
It is not an unprimeable number, because it can be changed into a prime (11133345556859) 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, 30743714 + ... + 31103739.
It is an arithmetic number, because the mean of its divisors is an integer number (1473670210185).
Almost surely, 211133345556889 is an apocalyptic number.
It is an amenable number.
11133345556889 is a deficient number, since it is larger than the sum of its proper divisors (656016124591).
11133345556889 is a wasteful number, since it uses less digits than its factorization.
11133345556889 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61858059.
The product of its digits is 46656000, while the sum is 62.
The spelling of 11133345556889 in words is "eleven trillion, one hundred thirty-three billion, three hundred forty-five million, five hundred fifty-six thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •