Base | Representation |
---|---|
bin | 10011101110000101… |
… | …01100010000111101 |
3 | 1000022211112212112221 |
4 | 21313002230100331 |
5 | 133140301111033 |
6 | 4510314525341 |
7 | 523234052665 |
oct | 116702542075 |
9 | 30284485487 |
10 | 10587128893 |
11 | 4543181700 |
12 | 2075736851 |
13 | cc952a713 |
14 | 7261191a5 |
15 | 41e6d712d |
hex | 2770ac43d |
10587128893 has 12 divisors (see below), whose sum is σ = 11708507104. Its totient is φ = 9565597800.
The previous prime is 10587128891. The next prime is 10587128933. The reversal of 10587128893 is 39882178501.
It is a happy number.
10587128893 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 10587128893 - 21 = 10587128891 is a prime.
It is a super-2 number, since 2×105871288932 (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 10587128893.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10587128891) 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, 248673 + ... + 288118.
Almost surely, 210587128893 is an apocalyptic number.
It is an amenable number.
10587128893 is a deficient number, since it is larger than the sum of its proper divisors (1121378211).
10587128893 is a wasteful number, since it uses less digits than its factorization.
10587128893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536976 (or 536965 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 52.
The spelling of 10587128893 in words is "ten billion, five hundred eighty-seven million, one hundred twenty-eight thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •