Base | Representation |
---|---|
bin | 101111000101010111… |
… | …101110001000000000 |
3 | 11211111022222101011010 |
4 | 233011113232020000 |
5 | 1312014312020143 |
6 | 35120341520520 |
7 | 3436552440453 |
oct | 570527561000 |
9 | 154438871133 |
10 | 50555970048 |
11 | 1a493588631 |
12 | 996b113140 |
13 | 49c8cc069c |
14 | 26384d549a |
15 | 14ad5b6a33 |
hex | bc55ee200 |
50555970048 has 80 divisors (see below), whose sum is σ = 139328671680. Its totient is φ = 16270872576.
The previous prime is 50555970041. The next prime is 50555970071. The reversal of 50555970048 is 84007955505.
It is a happy number.
It is a super-2 number, since 2×505559700482 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 50555969979 and 50555970006.
It is not an unprimeable number, because it can be changed into a prime (50555970041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 522940 + ... + 612027.
It is an arithmetic number, because the mean of its divisors is an integer number (1741608396).
Almost surely, 250555970048 is an apocalyptic number.
50555970048 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
It is an amenable number.
50555970048 is an abundant number, since it is smaller than the sum of its proper divisors (88772701632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50555970048 is a wasteful number, since it uses less digits than its factorization.
50555970048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1135017 (or 1135001 counting only the distinct ones).
The product of its (nonzero) digits is 1260000, while the sum is 48.
The spelling of 50555970048 in words is "fifty billion, five hundred fifty-five million, nine hundred seventy thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •