Base | Representation |
---|---|
bin | 1010000110000110101011… |
… | …0000011001110101011101 |
3 | 1110022011000011000112020211 |
4 | 2201201222300121311131 |
5 | 2423330233030111433 |
6 | 35335132522412421 |
7 | 2223643005032146 |
oct | 241415260316535 |
9 | 43264004015224 |
10 | 11099986566493 |
11 | 359a52904a240 |
12 | 12b3303061111 |
13 | 62695520c176 |
14 | 2a53568daacd |
15 | 143b0963d8cd |
hex | a186ac19d5d |
11099986566493 has 4 divisors (see below), whose sum is σ = 12109076254368. Its totient is φ = 10090896878620.
The previous prime is 11099986566457. The next prime is 11099986566499. The reversal of 11099986566493 is 39466568999011.
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 11099986566493 - 221 = 11099984469341 is a prime.
It is a super-2 number, since 2×110999865664932 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11099986566499) 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, 504544843921 + ... + 504544843942.
It is an arithmetic number, because the mean of its divisors is an integer number (3027269063592).
Almost surely, 211099986566493 is an apocalyptic number.
It is an amenable number.
11099986566493 is a deficient number, since it is larger than the sum of its proper divisors (1009089687875).
11099986566493 is a wasteful number, since it uses less digits than its factorization.
11099986566493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009089687874.
The product of its (nonzero) digits is 680244480, while the sum is 76.
The spelling of 11099986566493 in words is "eleven trillion, ninety-nine billion, nine hundred eighty-six million, five hundred sixty-six thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •