Base | Representation |
---|---|
bin | 10101110001100000… |
… | …10100111011001011 |
3 | 1010011200001202121220 |
4 | 22320300110323023 |
5 | 142420020022310 |
6 | 5211540533123 |
7 | 562452024261 |
oct | 127060247313 |
9 | 33150052556 |
10 | 11689610955 |
11 | 4a59531800 |
12 | 23229b11a3 |
13 | 1143a6a079 |
14 | 7cc702431 |
15 | 4863ad670 |
hex | 2b8c14ecb |
11689610955 has 48 divisors (see below), whose sum is σ = 20586599712. Its totient is φ = 5659878400.
The previous prime is 11689610953. The next prime is 11689610971. The reversal of 11689610955 is 55901698611.
11689610955 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11689610955 - 21 = 11689610953 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11689610898 and 11689610907.
It is not an unprimeable number, because it can be changed into a prime (11689610953) 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 47 ways as a sum of consecutive naturals, for example, 1442515 + ... + 1450595.
It is an arithmetic number, because the mean of its divisors is an integer number (428887494).
Almost surely, 211689610955 is an apocalyptic number.
11689610955 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11689610955 is a deficient number, since it is larger than the sum of its proper divisors (8896988757).
11689610955 is a wasteful number, since it uses less digits than its factorization.
11689610955 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8908 (or 8897 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 51.
The spelling of 11689610955 in words is "eleven billion, six hundred eighty-nine million, six hundred ten thousand, nine hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.232 sec. • engine limits •