Base | Representation |
---|---|
bin | 10100011100011110… |
… | …00100101010110101 |
3 | 1001022221202022010010 |
4 | 22032033010222311 |
5 | 134434410004144 |
6 | 5013055050433 |
7 | 536000406315 |
oct | 121617045265 |
9 | 31287668103 |
10 | 10976250549 |
11 | 4722897550 |
12 | 2163b10a19 |
13 | 105c030714 |
14 | 761a8b445 |
15 | 44394c5b9 |
hex | 28e3c4ab5 |
10976250549 has 32 divisors (see below), whose sum is σ = 16912419840. Its totient is φ = 6258067200.
The previous prime is 10976250547. The next prime is 10976250613. The reversal of 10976250549 is 94505267901.
10976250549 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 10976250549 - 21 = 10976250547 is a prime.
It is a super-2 number, since 2×109762505492 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10976250498 and 10976250507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10976250541) 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, 2000592 + ... + 2006070.
It is an arithmetic number, because the mean of its divisors is an integer number (528513120).
Almost surely, 210976250549 is an apocalyptic number.
It is an amenable number.
10976250549 is a deficient number, since it is larger than the sum of its proper divisors (5936169291).
10976250549 is a wasteful number, since it uses less digits than its factorization.
10976250549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9081.
The product of its (nonzero) digits is 680400, while the sum is 48.
The spelling of 10976250549 in words is "ten billion, nine hundred seventy-six million, two hundred fifty thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •