Base | Representation |
---|---|
bin | 10101000101011010… |
… | …01000011100101101 |
3 | 1002012212222001102222 |
4 | 22202231020130231 |
5 | 141140314042134 |
6 | 5111123525125 |
7 | 550340434652 |
oct | 124255103455 |
9 | 32185861388 |
10 | 11319674669 |
11 | 4889730136 |
12 | 223ab297a5 |
13 | 10b5223764 |
14 | 795525c29 |
15 | 463b87a2e |
hex | 2a2b4872d |
11319674669 has 8 divisors (see below), whose sum is σ = 12038288640. Its totient is φ = 10613344896.
The previous prime is 11319674647. The next prime is 11319674671. The reversal of 11319674669 is 96647691311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11319674669 is a prime.
It is a super-2 number, since 2×113196746692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11319674669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11319674629) 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, 3069149 + ... + 3072834.
It is an arithmetic number, because the mean of its divisors is an integer number (1504786080).
Almost surely, 211319674669 is an apocalyptic number.
11319674669 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
11319674669 is a deficient number, since it is larger than the sum of its proper divisors (718613971).
11319674669 is an equidigital number, since it uses as much as digits as its factorization.
11319674669 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6142099.
The product of its digits is 1469664, while the sum is 53.
The spelling of 11319674669 in words is "eleven billion, three hundred nineteen million, six hundred seventy-four thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •