Base | Representation |
---|---|
bin | 1001010010000101110110… |
… | …1001101111110010110010 |
3 | 1100010201112111200111212102 |
4 | 2110201131221233302302 |
5 | 2314210213330120200 |
6 | 33412432303100402 |
7 | 2102250304331426 |
oct | 224413551576262 |
9 | 40121474614772 |
10 | 10206413520050 |
11 | 3285574395810 |
12 | 118a0a32a1702 |
13 | 5905cb109877 |
14 | 273dc8d02b86 |
15 | 12a75b4846d5 |
hex | 9485da6fcb2 |
10206413520050 has 96 divisors (see below), whose sum is σ = 22125097831680. Its totient is φ = 3463605921600.
The previous prime is 10206413519989. The next prime is 10206413520073. The reversal of 10206413520050 is 5002531460201.
It is a junction number, because it is equal to n+sod(n) for n = 10206413519995 and 10206413520022.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6588584 + ... + 7988883.
It is an arithmetic number, because the mean of its divisors is an integer number (230469769080).
Almost surely, 210206413520050 is an apocalyptic number.
10206413520050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10206413520050 is an abundant number, since it is smaller than the sum of its proper divisors (11918684311630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10206413520050 is a wasteful number, since it uses less digits than its factorization.
10206413520050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14577576 (or 14577571 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 10206413520050 its reverse (5002531460201), we get a palindrome (15208944980251).
The spelling of 10206413520050 in words is "ten trillion, two hundred six billion, four hundred thirteen million, five hundred twenty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •