Base | Representation |
---|---|
bin | 10100010110101000… |
… | …01010110010110111 |
3 | 1001012112120001110110 |
4 | 22023110022302313 |
5 | 134334334122321 |
6 | 5004144554103 |
7 | 534534063312 |
oct | 121324126267 |
9 | 31175501413 |
10 | 10927254711 |
11 | 46a817221a |
12 | 214b622933 |
13 | 1051b373b9 |
14 | 759375979 |
15 | 43e4c0176 |
hex | 28b50acb7 |
10927254711 has 16 divisors (see below), whose sum is σ = 15394832640. Its totient is φ = 6875173440.
The previous prime is 10927254691. The next prime is 10927254731. The reversal of 10927254711 is 11745272901.
10927254711 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10927254691) and next prime (10927254731).
It is not a de Polignac number, because 10927254711 - 26 = 10927254647 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10927254711.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10927254731) 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 15 ways as a sum of consecutive naturals, for example, 349470 + ... + 379451.
It is an arithmetic number, because the mean of its divisors is an integer number (962177040).
Almost surely, 210927254711 is an apocalyptic number.
10927254711 is a deficient number, since it is larger than the sum of its proper divisors (4467577929).
10927254711 is a wasteful number, since it uses less digits than its factorization.
10927254711 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729206.
The product of its (nonzero) digits is 35280, while the sum is 39.
The spelling of 10927254711 in words is "ten billion, nine hundred twenty-seven million, two hundred fifty-four thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •