Base | Representation |
---|---|
bin | 101111000011110110… |
… | …000000110010110101 |
3 | 11211102112210001211200 |
4 | 233003312000302311 |
5 | 1311441232401110 |
6 | 35114024523113 |
7 | 3436121641224 |
oct | 570366006265 |
9 | 154375701750 |
10 | 50530356405 |
11 | 1a480083731 |
12 | 9962620499 |
13 | 49c38c3099 |
14 | 2634d48cbb |
15 | 14ab2076c0 |
hex | bc3d80cb5 |
50530356405 has 24 divisors (see below), whose sum is σ = 88092241848. Its totient is φ = 26793741696.
The previous prime is 50530356389. The next prime is 50530356413. The reversal of 50530356405 is 50465303505.
50530356405 is a `hidden beast` number, since 5 + 0 + 5 + 3 + 0 + 3 + 5 + 640 + 5 = 666.
50530356405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 3981862404 + 46548494001 = 63102^2 + 215751^2 .
It is not a de Polignac number, because 50530356405 - 24 = 50530356389 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50530356405.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3237582 + ... + 3253151.
It is an arithmetic number, because the mean of its divisors is an integer number (3670510077).
Almost surely, 250530356405 is an apocalyptic number.
It is an amenable number.
50530356405 is a deficient number, since it is larger than the sum of its proper divisors (37561885443).
50530356405 is a wasteful number, since it uses less digits than its factorization.
50530356405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6490917 (or 6490914 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 36.
The spelling of 50530356405 in words is "fifty billion, five hundred thirty million, three hundred fifty-six thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •