Base | Representation |
---|---|
bin | 100100110010001010011… |
… | …0001011001110111111110 |
3 | 122220022012020012111222112 |
4 | 1021210110301121313332 |
5 | 1130312203400042000 |
6 | 14430250502014022 |
7 | 1031151423332465 |
oct | 111442461316776 |
9 | 18808166174875 |
10 | 5055525002750 |
11 | 167a044080992 |
12 | 697965117312 |
13 | 2a8970690191 |
14 | 13698db9b9dc |
15 | 8b78c174235 |
hex | 49914c59dfe |
5055525002750 has 32 divisors (see below), whose sum is σ = 9476249983200. Its totient is φ = 2019580262400.
The previous prime is 5055525002687. The next prime is 5055525002789. The reversal of 5055525002750 is 572005255505.
It is a junction number, because it is equal to n+sod(n) for n = 5055525002698 and 5055525002707.
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 15 ways as a sum of consecutive naturals, for example, 12956060 + ... + 13340559.
It is an arithmetic number, because the mean of its divisors is an integer number (296132811975).
Almost surely, 25055525002750 is an apocalyptic number.
5055525002750 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5055525002750 is a deficient number, since it is larger than the sum of its proper divisors (4420724980450).
5055525002750 is a wasteful number, since it uses less digits than its factorization.
5055525002750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26297405 (or 26297395 counting only the distinct ones).
The product of its (nonzero) digits is 437500, while the sum is 41.
The spelling of 5055525002750 in words is "five trillion, fifty-five billion, five hundred twenty-five million, two thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •