Base | Representation |
---|---|
bin | 10100001101111000… |
… | …11101011101101001 |
3 | 1001000102120211001011 |
4 | 22012330131131221 |
5 | 134212101241412 |
6 | 4553005223521 |
7 | 532653614200 |
oct | 120674353551 |
9 | 31012524034 |
10 | 10853930857 |
11 | 466a8409a0 |
12 | 212ab61ba1 |
13 | 103c8a39c3 |
14 | 74d72a237 |
15 | 437d397a7 |
hex | 286f1d769 |
10853930857 has 24 divisors (see below), whose sum is σ = 14584056480. Its totient is φ = 7960095360.
The previous prime is 10853930821. The next prime is 10853930869. The reversal of 10853930857 is 75803935801.
It is not a de Polignac number, because 10853930857 - 219 = 10853406569 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a self number, because there is not a number n which added to its sum of digits gives 10853930857.
It is not an unprimeable number, because it can be changed into a prime (10853930257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 583107 + ... + 601432.
It is an arithmetic number, because the mean of its divisors is an integer number (607669020).
Almost surely, 210853930857 is an apocalyptic number.
10853930857 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
10853930857 is a deficient number, since it is larger than the sum of its proper divisors (3730125623).
10853930857 is a wasteful number, since it uses less digits than its factorization.
10853930857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1184581 (or 1184574 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 49.
The spelling of 10853930857 in words is "ten billion, eight hundred fifty-three million, nine hundred thirty thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •