Base | Representation |
---|---|
bin | 10100001101101100… |
… | …11011100010110111 |
3 | 1001000022121111200220 |
4 | 22012312123202313 |
5 | 134211200201020 |
6 | 4552511305423 |
7 | 532634311524 |
oct | 120666334267 |
9 | 31008544626 |
10 | 10852350135 |
11 | 4669961310 |
12 | 212a51b273 |
13 | 103c46c373 |
14 | 74d43814b |
15 | 437b26240 |
hex | 286d9b8b7 |
10852350135 has 32 divisors (see below), whose sum is σ = 18964482048. Its totient is φ = 5255579520.
The previous prime is 10852350133. The next prime is 10852350151. The reversal of 10852350135 is 53105325801.
It is not a de Polignac number, because 10852350135 - 21 = 10852350133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 10852350096 and 10852350105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10852350133) 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 31 ways as a sum of consecutive naturals, for example, 104289 + ... + 180501.
It is an arithmetic number, because the mean of its divisors is an integer number (592640064).
Almost surely, 210852350135 is an apocalyptic number.
10852350135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10852350135 is a deficient number, since it is larger than the sum of its proper divisors (8112131913).
10852350135 is a wasteful number, since it uses less digits than its factorization.
10852350135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77095.
The product of its (nonzero) digits is 18000, while the sum is 33.
Adding to 10852350135 its reverse (53105325801), we get a palindrome (63957675936).
The spelling of 10852350135 in words is "ten billion, eight hundred fifty-two million, three hundred fifty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •