Base | Representation |
---|---|
bin | 1010000000101011001011… |
… | …1000101000101010110001 |
3 | 1102222020020100211002002002 |
4 | 2200022302320220222301 |
5 | 2420313214043402231 |
6 | 35224224522303345 |
7 | 2214131320156361 |
oct | 240126270505261 |
9 | 42866210732062 |
10 | 11006707403441 |
11 | 3563a11426442 |
12 | 1299210057b55 |
13 | 61ac0ac21c29 |
14 | 2a0a282c89a1 |
15 | 14149a4780cb |
hex | a02b2e28ab1 |
11006707403441 has 8 divisors (see below), whose sum is σ = 11902121648640. Its totient is φ = 10138844365888.
The previous prime is 11006707403437. The next prime is 11006707403443. The reversal of 11006707403441 is 14430470760011.
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 11006707403441 - 22 = 11006707403437 is a prime.
It is a super-2 number, since 2×110067074034412 (a number of 27 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 = 11006707403395 and 11006707403404.
It is not an unprimeable number, because it can be changed into a prime (11006707403443) 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, 6887801081 + ... + 6887802678.
It is an arithmetic number, because the mean of its divisors is an integer number (1487765206080).
Almost surely, 211006707403441 is an apocalyptic number.
It is an amenable number.
11006707403441 is a deficient number, since it is larger than the sum of its proper divisors (895414245199).
11006707403441 is a wasteful number, since it uses less digits than its factorization.
11006707403441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13775603823.
The product of its (nonzero) digits is 56448, while the sum is 38.
The spelling of 11006707403441 in words is "eleven trillion, six billion, seven hundred seven million, four hundred three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •