Base | Representation |
---|---|
bin | 10101101110010100… |
… | …11010101001001001 |
3 | 1010002210210111011121 |
4 | 22313022122221021 |
5 | 142341200130224 |
6 | 5205144155241 |
7 | 562005656224 |
oct | 126712325111 |
9 | 33083714147 |
10 | 11662895689 |
11 | 4a45445175 |
12 | 2315a68b21 |
13 | 113b375213 |
14 | 7c8d4a5bb |
15 | 483d82be4 |
hex | 2b729aa49 |
11662895689 has 12 divisors (see below), whose sum is σ = 12138470400. Its totient is φ = 11203936848.
The previous prime is 11662895677. The next prime is 11662895701. The reversal of 11662895689 is 98659826611.
11662895689 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11662895677) and next prime (11662895701).
It is not a de Polignac number, because 11662895689 - 27 = 11662895561 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11662895089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 54232 + ... + 162070.
It is an arithmetic number, because the mean of its divisors is an integer number (1011539200).
Almost surely, 211662895689 is an apocalyptic number.
It is an amenable number.
11662895689 is a deficient number, since it is larger than the sum of its proper divisors (475574711).
11662895689 is an equidigital number, since it uses as much as digits as its factorization.
11662895689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107992 (or 107955 counting only the distinct ones).
The product of its digits is 11197440, while the sum is 61.
The spelling of 11662895689 in words is "eleven billion, six hundred sixty-two million, eight hundred ninety-five thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •