Base | Representation |
---|---|
bin | 101110101011110111… |
… | …011110101100101101 |
3 | 11210101111211201010102 |
4 | 232223313132230231 |
5 | 1310130242302403 |
6 | 35010054520445 |
7 | 3423135500504 |
oct | 565367365455 |
9 | 153344751112 |
10 | 50128087853 |
11 | 1a293aa9388 |
12 | 986b966125 |
13 | 495b46905c |
14 | 25d775383b |
15 | 1485c46b88 |
hex | babddeb2d |
50128087853 has 4 divisors (see below), whose sum is σ = 50145275580. Its totient is φ = 50110900128.
The previous prime is 50128087777. The next prime is 50128087859. The reversal of 50128087853 is 35878082105.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 44431159369 + 5696928484 = 210787^2 + 75478^2 .
It is a cyclic number.
It is not a de Polignac number, because 50128087853 - 228 = 49859652397 is a prime.
It is a super-2 number, since 2×501280878532 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50128087798 and 50128087807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50128087859) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8589488 + ... + 8595321.
It is an arithmetic number, because the mean of its divisors is an integer number (12536318895).
Almost surely, 250128087853 is an apocalyptic number.
It is an amenable number.
50128087853 is a deficient number, since it is larger than the sum of its proper divisors (17187727).
50128087853 is a wasteful number, since it uses less digits than its factorization.
50128087853 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17187726.
The product of its (nonzero) digits is 537600, while the sum is 47.
The spelling of 50128087853 in words is "fifty billion, one hundred twenty-eight million, eighty-seven thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •