Base | Representation |
---|---|
bin | 10101100011100000… |
… | …01011011101010101 |
3 | 1002212111000012100020 |
4 | 22301300023131111 |
5 | 142144431203134 |
6 | 5152142535353 |
7 | 556524332130 |
oct | 126160133525 |
9 | 32774005306 |
10 | 11572131669 |
11 | 49a919188a |
12 | 22ab597559 |
13 | 11256165b7 |
14 | 7bac81217 |
15 | 47ae04b49 |
hex | 2b1c0b755 |
11572131669 has 32 divisors (see below), whose sum is σ = 17820549120. Its totient is φ = 6542871552.
The previous prime is 11572131653. The next prime is 11572131689. The reversal of 11572131669 is 96613127511.
11572131669 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 11572131669 - 24 = 11572131653 is a prime.
It is a super-2 number, since 2×115721316692 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11572131669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11572131619) 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 31 ways as a sum of consecutive naturals, for example, 1015797 + ... + 1027125.
It is an arithmetic number, because the mean of its divisors is an integer number (556892160).
Almost surely, 211572131669 is an apocalyptic number.
It is an amenable number.
11572131669 is a deficient number, since it is larger than the sum of its proper divisors (6248417451).
11572131669 is a wasteful number, since it uses less digits than its factorization.
11572131669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11849.
The product of its digits is 68040, while the sum is 42.
The spelling of 11572131669 in words is "eleven billion, five hundred seventy-two million, one hundred thirty-one thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •