Base | Representation |
---|---|
bin | 100100101111110110010… |
… | …0100011100111100100101 |
3 | 122212211100220022020110110 |
4 | 1021133230210130330211 |
5 | 1130222014210122100 |
6 | 14424105421243233 |
7 | 1030614321600501 |
oct | 111375444347445 |
9 | 18784326266413 |
10 | 5050555551525 |
11 | 1677a23a39700 |
12 | 6969b8a03519 |
13 | 2a835ac692b3 |
14 | 13663bbad301 |
15 | 8b59ac54250 |
hex | 497ec91cf25 |
5050555551525 has 72 divisors (see below), whose sum is σ = 9224970001632. Its totient is φ = 2436323120000.
The previous prime is 5050555551479. The next prime is 5050555551563. The reversal of 5050555551525 is 5251555550505.
It is a happy number.
It is not a de Polignac number, because 5050555551525 - 27 = 5050555551397 is a prime.
It is a super-2 number, since 2×50505555515252 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
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 71 ways as a sum of consecutive naturals, for example, 375250 + ... + 3200300.
It is an arithmetic number, because the mean of its divisors is an integer number (128124583356).
Almost surely, 25050555551525 is an apocalyptic number.
5050555551525 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5050555551525 is a deficient number, since it is larger than the sum of its proper divisors (4174414450107).
5050555551525 is a wasteful number, since it uses less digits than its factorization.
5050555551525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2825283 (or 2825267 counting only the distinct ones).
The product of its (nonzero) digits is 3906250, while the sum is 48.
The spelling of 5050555551525 in words is "five trillion, fifty billion, five hundred fifty-five million, five hundred fifty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •