Base | Representation |
---|---|
bin | 1001010010000101001110… |
… | …0000001111011100111101 |
3 | 1100010201002122022012200010 |
4 | 2110201103200033130331 |
5 | 2314204341233144000 |
6 | 33412403341453433 |
7 | 2102243136163230 |
oct | 224412340173475 |
9 | 40121078265603 |
10 | 10206243256125 |
11 | 3285497272a24 |
12 | 118a056271279 |
13 | 5905a1a64397 |
14 | 273db0461417 |
15 | 12a74b550d50 |
hex | 9485380f73d |
10206243256125 has 128 divisors (see below), whose sum is σ = 20164856325120. Its totient is φ = 4485482803200.
The previous prime is 10206243256123. The next prime is 10206243256159. The reversal of 10206243256125 is 52165234260201.
It is not a de Polignac number, because 10206243256125 - 21 = 10206243256123 is a prime.
It is a super-3 number, since 3×102062432561253 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10206243256123) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 17449417 + ... + 18024833.
It is an arithmetic number, because the mean of its divisors is an integer number (157537940040).
Almost surely, 210206243256125 is an apocalyptic number.
10206243256125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10206243256125 is a deficient number, since it is larger than the sum of its proper divisors (9958613068995).
10206243256125 is a wasteful number, since it uses less digits than its factorization.
10206243256125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575704 (or 575694 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 39.
The spelling of 10206243256125 in words is "ten trillion, two hundred six billion, two hundred forty-three million, two hundred fifty-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •