Base | Representation |
---|---|
bin | 101110111101100101… |
… | …000100101000110101 |
3 | 11211011020000020020221 |
4 | 232331211010220311 |
5 | 1311232331034110 |
6 | 35055352054341 |
7 | 3433404400453 |
oct | 567545045065 |
9 | 154136006227 |
10 | 50425252405 |
11 | 1a426816520 |
12 | 99333943b1 |
13 | 49a7bb3378 |
14 | 2624dc99d3 |
15 | 14a1d957da |
hex | bbd944a35 |
50425252405 has 32 divisors (see below), whose sum is σ = 68767574400. Its totient is φ = 35171942400.
The previous prime is 50425252399. The next prime is 50425252439.
50425252405 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 50425252405 - 27 = 50425252277 is a prime.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 56460 + ... + 322549.
It is an arithmetic number, because the mean of its divisors is an integer number (2148986700).
Almost surely, 250425252405 is an apocalyptic number.
50425252405 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50425252405 is a deficient number, since it is larger than the sum of its proper divisors (18342321995).
50425252405 is a wasteful number, since it uses less digits than its factorization.
50425252405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379125.
The product of its (nonzero) digits is 80000, while the sum is 34.
The spelling of 50425252405 in words is "fifty billion, four hundred twenty-five million, two hundred fifty-two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •