Base | Representation |
---|---|
bin | 10110110000101110100000… |
… | …11001100001101000000110 |
3 | 20120012222220020001202000021 |
4 | 23120113100121201220012 |
5 | 23030031013031040200 |
6 | 254241525510205354 |
7 | 13354122545235643 |
oct | 1330272031415006 |
9 | 216188806052007 |
10 | 50052750252550 |
11 | 14a48285710631 |
12 | 574468495385a |
13 | 21c0c531c2776 |
14 | c507cd2ccdca |
15 | 5bbec0bb441a |
hex | 2d85d0661a06 |
50052750252550 has 24 divisors (see below), whose sum is σ = 97998016285800. Its totient is φ = 18967357990080.
The previous prime is 50052750252517. The next prime is 50052750252563. The reversal of 50052750252550 is 5525205725005.
It is a junction number, because it is equal to n+sod(n) for n = 50052750252497 and 50052750252506.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26343551815 + ... + 26343553714.
It is an arithmetic number, because the mean of its divisors is an integer number (4083250678575).
Almost surely, 250052750252550 is an apocalyptic number.
50052750252550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50052750252550 is a deficient number, since it is larger than the sum of its proper divisors (47945266033250).
50052750252550 is a wasteful number, since it uses less digits than its factorization.
50052750252550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52687105560 (or 52687105555 counting only the distinct ones).
The product of its (nonzero) digits is 875000, while the sum is 43.
Adding to 50052750252550 its reverse (5525205725005), we get a palindrome (55577955977555).
The spelling of 50052750252550 in words is "fifty trillion, fifty-two billion, seven hundred fifty million, two hundred fifty-two thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •