Base | Representation |
---|---|
bin | 10011111000101010… |
… | …01100000000001001 |
3 | 1000120000112001122010 |
4 | 21330111030000021 |
5 | 133331010113221 |
6 | 4523204450133 |
7 | 525362225436 |
oct | 117425140011 |
9 | 30500461563 |
10 | 10675863561 |
11 | 4589279340 |
12 | 209b3a9949 |
13 | 1011a2873c |
14 | 733c16b8d |
15 | 4273b3c76 |
hex | 27c54c009 |
10675863561 has 32 divisors (see below), whose sum is σ = 15961430016. Its totient is φ = 6290136000.
The previous prime is 10675863529. The next prime is 10675863599. The reversal of 10675863561 is 16536857601.
It is not a de Polignac number, because 10675863561 - 25 = 10675863529 is a prime.
It is a super-2 number, since 2×106758635612 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10675863561.
It is not an unprimeable number, because it can be changed into a prime (10675863521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1866496 + ... + 1872206.
It is an arithmetic number, because the mean of its divisors is an integer number (498794688).
Almost surely, 210675863561 is an apocalyptic number.
10675863561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10675863561 is a deficient number, since it is larger than the sum of its proper divisors (5285566455).
10675863561 is a wasteful number, since it uses less digits than its factorization.
10675863561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7293.
The product of its (nonzero) digits is 907200, while the sum is 48.
The spelling of 10675863561 in words is "ten billion, six hundred seventy-five million, eight hundred sixty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •