Base | Representation |
---|---|
bin | 10010101110000011… |
… | …11100100010100100 |
3 | 221221101222001222001 |
4 | 21113001330202210 |
5 | 131040304000000 |
6 | 4341131415044 |
7 | 504023056522 |
oct | 112701744244 |
9 | 27841861861 |
10 | 10050062500 |
11 | 4297aa8785 |
12 | 1b458b4484 |
13 | c4219815a |
14 | 6b4a75312 |
15 | 3dc49b46a |
hex | 25707c8a4 |
10050062500 has 63 divisors (see below), whose sum is σ = 22039190551. Its totient is φ = 4010000000.
The previous prime is 10050062489. The next prime is 10050062527. The reversal of 10050062500 is 526005001.
It is a happy number.
The square root of 10050062500 is 100250.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 10 ways, for example, as 9386896996 + 663165504 = 96886^2 + 25752^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 25062300 + ... + 25062700.
Almost surely, 210050062500 is an apocalyptic number.
10050062500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10050062500 is the 100250-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10050062500
10050062500 is an abundant number, since it is smaller than the sum of its proper divisors (11989128051).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10050062500 is an frugal number, since it uses more digits than its factorization.
10050062500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836 (or 408 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 19.
Adding to 10050062500 its reverse (526005001), we get a palindrome (10576067501).
The spelling of 10050062500 in words is "ten billion, fifty million, sixty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •