Base | Representation |
---|---|
bin | 101111001001100100… |
… | …111100101011001100 |
3 | 11211200020210000200100 |
4 | 233021210330223030 |
5 | 1312140343441010 |
6 | 35131342331100 |
7 | 3441400354404 |
oct | 571144745314 |
9 | 154606700610 |
10 | 50626546380 |
11 | 1a51a402683 |
12 | 998a889a90 |
13 | 4a0a801627 |
14 | 2643a27804 |
15 | 14b48a82c0 |
hex | bc993cacc |
50626546380 has 72 divisors (see below), whose sum is σ = 162600564672. Its totient is φ = 12706269696.
The previous prime is 50626546343. The next prime is 50626546381. The reversal of 50626546380 is 8364562605.
50626546380 is a `hidden beast` number, since 5 + 0 + 6 + 2 + 6 + 5 + 4 + 638 + 0 = 666.
It is a super-2 number, since 2×506265463802 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (50626546381) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 8269252 + ... + 8275371.
It is an arithmetic number, because the mean of its divisors is an integer number (2258341176).
Almost surely, 250626546380 is an apocalyptic number.
It is an amenable number.
50626546380 is an abundant number, since it is smaller than the sum of its proper divisors (111974018292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50626546380 is a wasteful number, since it uses less digits than its factorization.
50626546380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16544655 (or 16544650 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 45.
The spelling of 50626546380 in words is "fifty billion, six hundred twenty-six million, five hundred forty-six thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •