Base | Representation |
---|---|
bin | 10100011110000110… |
… | …11001100010100111 |
3 | 1001100220120012021100 |
4 | 22033003121202213 |
5 | 140001412430102 |
6 | 5014305051143 |
7 | 536225116440 |
oct | 121703314247 |
9 | 31326505240 |
10 | 10989967527 |
11 | 472a6062a0 |
12 | 2168626ab3 |
13 | 1061b24086 |
14 | 76381c2c7 |
15 | 444c5ba1c |
hex | 28f0d98a7 |
10989967527 has 96 divisors (see below), whose sum is σ = 20166082560. Its totient is φ = 5601960000.
The previous prime is 10989967523. The next prime is 10989967529. The reversal of 10989967527 is 72576998901.
10989967527 is a `hidden beast` number, since 10 + 9 + 8 + 9 + 96 + 7 + 527 = 666.
10989967527 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 10989967527 - 22 = 10989967523 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10989967523) 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 95 ways as a sum of consecutive naturals, for example, 10456152 + ... + 10457202.
It is an arithmetic number, because the mean of its divisors is an integer number (210063360).
Almost surely, 210989967527 is an apocalyptic number.
10989967527 is a deficient number, since it is larger than the sum of its proper divisors (9176115033).
10989967527 is a wasteful number, since it uses less digits than its factorization.
10989967527 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1345 (or 1342 counting only the distinct ones).
The product of its (nonzero) digits is 17146080, while the sum is 63.
The spelling of 10989967527 in words is "ten billion, nine hundred eighty-nine million, nine hundred sixty-seven thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •