Base | Representation |
---|---|
bin | 10100000101110001… |
… | …00101011011100010 |
3 | 1000211200101201101011 |
4 | 22002320211123202 |
5 | 134042131243200 |
6 | 4542133131134 |
7 | 531165560455 |
oct | 120270453342 |
9 | 30750351334 |
10 | 10785806050 |
11 | 46353407a8 |
12 | 2110189aaa |
13 | 102b740876 |
14 | 74467549c |
15 | 431d7e5ba |
hex | 282e256e2 |
10785806050 has 12 divisors (see below), whose sum is σ = 20061599346. Its totient is φ = 4314322400.
The previous prime is 10785806023. The next prime is 10785806051. The reversal of 10785806050 is 5060858701.
10785806050 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 5022415161 + 5763390889 = 70869^2 + 75917^2 .
It is a super-3 number, since 3×107858060503 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 10785805994 and 10785806012.
It is not an unprimeable number, because it can be changed into a prime (10785806051) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 107858011 + ... + 107858110.
Almost surely, 210785806050 is an apocalyptic number.
10785806050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10785806050 is a deficient number, since it is larger than the sum of its proper divisors (9275793296).
10785806050 is a wasteful number, since it uses less digits than its factorization.
10785806050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215716133 (or 215716128 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 40.
The spelling of 10785806050 in words is "ten billion, seven hundred eighty-five million, eight hundred six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •