Base | Representation |
---|---|
bin | 10110010010000111… |
… | …01111011001010001 |
3 | 1010212201202020212011 |
4 | 23021003233121101 |
5 | 144000030314234 |
6 | 5255031302521 |
7 | 602312655160 |
oct | 131103573121 |
9 | 33781666764 |
10 | 11963135569 |
11 | 5089972900 |
12 | 239a51aa41 |
13 | 1188628258 |
14 | 816b833d7 |
15 | 4a03dcb64 |
hex | 2c90ef651 |
11963135569 has 48 divisors (see below), whose sum is σ = 16425980928. Its totient is φ = 8490240000.
The previous prime is 11963135551. The next prime is 11963135573. The reversal of 11963135569 is 96553136911.
11963135569 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 11963135569 - 217 = 11963004497 is a prime.
It is a super-2 number, since 2×119631355692 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11963135539) 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, 432969 + ... + 459769.
It is an arithmetic number, because the mean of its divisors is an integer number (342207936).
Almost surely, 211963135569 is an apocalyptic number.
It is an amenable number.
11963135569 is a deficient number, since it is larger than the sum of its proper divisors (4462845359).
11963135569 is a wasteful number, since it uses less digits than its factorization.
11963135569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26878 (or 26867 counting only the distinct ones).
The product of its digits is 656100, while the sum is 49.
The spelling of 11963135569 in words is "eleven billion, nine hundred sixty-three million, one hundred thirty-five thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •