Base | Representation |
---|---|
bin | 10000100111011101110… |
… | …101011110101001101101 |
3 | 11001011102010221121022201 |
4 | 100213131311132221231 |
5 | 122202041324223412 |
6 | 2232324241141501 |
7 | 145333023564451 |
oct | 20473565365155 |
9 | 4034363847281 |
10 | 1141888117357 |
11 | 4002aa0895a9 |
12 | 16538002a891 |
13 | 838ab090930 |
14 | 3d3a6728661 |
15 | 1ea830e9e57 |
hex | 109ddd5ea6d |
1141888117357 has 8 divisors (see below), whose sum is σ = 1235905193600. Its totient is φ = 1048753830960.
The previous prime is 1141888117277. The next prime is 1141888117411. The reversal of 1141888117357 is 7537118881411.
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 1141888117357 - 231 = 1139740633709 is a prime.
It is a super-2 number, since 2×11418881173572 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1141888117298 and 1141888117307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141888114357) 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, 220694769 + ... + 220699942.
It is an arithmetic number, because the mean of its divisors is an integer number (154488149200).
Almost surely, 21141888117357 is an apocalyptic number.
It is an amenable number.
1141888117357 is a deficient number, since it is larger than the sum of its proper divisors (94017076243).
1141888117357 is a wasteful number, since it uses less digits than its factorization.
1141888117357 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 441394923.
The product of its digits is 1505280, while the sum is 55.
The spelling of 1141888117357 in words is "one trillion, one hundred forty-one billion, eight hundred eighty-eight million, one hundred seventeen thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •