Base | Representation |
---|---|
bin | 10110110110011110110111… |
… | …00000000001010001110100 |
3 | 20120220220100002111210002202 |
4 | 23123033123200001101310 |
5 | 23041301013240000202 |
6 | 254512432512524032 |
7 | 13404323233661210 |
oct | 1333173340012164 |
9 | 216826302453082 |
10 | 50250505000052 |
11 | 15014135054355 |
12 | 5776a74550618 |
13 | 22067aa2c7a66 |
14 | c5a1cd113940 |
15 | 5c21e6e7d802 |
hex | 2db3db801474 |
50250505000052 has 48 divisors (see below), whose sum is σ = 102960272069760. Its totient is φ = 21009027801600.
The previous prime is 50250505000027. The next prime is 50250505000061. The reversal of 50250505000052 is 25000050505205.
It is a happy number.
It is a super-2 number, since 2×502505050000522 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50250504999979 and 50250505000024.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13098527 + ... + 16494617.
It is an arithmetic number, because the mean of its divisors is an integer number (2145005668120).
Almost surely, 250250505000052 is an apocalyptic number.
It is an amenable number.
50250505000052 is an abundant number, since it is smaller than the sum of its proper divisors (52709767069708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50250505000052 is a wasteful number, since it uses less digits than its factorization.
50250505000052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3409032 (or 3409030 counting only the distinct ones).
The product of its (nonzero) digits is 12500, while the sum is 29.
Adding to 50250505000052 its reverse (25000050505205), we get a palindrome (75250555505257).
The spelling of 50250505000052 in words is "fifty trillion, two hundred fifty billion, five hundred five million, fifty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •