Base | Representation |
---|---|
bin | 10110111111010110100010… |
… | …11000110000000001111101 |
3 | 20122000001000020200100020002 |
4 | 23133223101120300001331 |
5 | 23111244202132002003 |
6 | 255304435112004045 |
7 | 13435332626512205 |
oct | 1337532130600175 |
9 | 218001006610202 |
10 | 50555278000253 |
11 | 15121411504314 |
12 | 5805b50390625 |
13 | 222945ac36730 |
14 | c6ac62107405 |
15 | 5ca0d36a4a88 |
hex | 2dfad163007d |
50555278000253 has 16 divisors (see below), whose sum is σ = 56558372752896. Its totient is φ = 44873392374720.
The previous prime is 50555278000223. The next prime is 50555278000259. The reversal of 50555278000253 is 35200087255505.
It is not a de Polignac number, because 50555278000253 - 218 = 50555277738109 is a prime.
It is a super-2 number, since 2×505552780002532 (a number of 28 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 = 50555278000198 and 50555278000207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50555278000259) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 399450551 + ... + 399577092.
It is an arithmetic number, because the mean of its divisors is an integer number (3534898297056).
Almost surely, 250555278000253 is an apocalyptic number.
It is an amenable number.
50555278000253 is a deficient number, since it is larger than the sum of its proper divisors (6003094752643).
50555278000253 is a wasteful number, since it uses less digits than its factorization.
50555278000253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 799027844.
The product of its (nonzero) digits is 2100000, while the sum is 47.
The spelling of 50555278000253 in words is "fifty trillion, five hundred fifty-five billion, two hundred seventy-eight million, two hundred fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •