Base | Representation |
---|---|
bin | 101110110111000110… |
… | …000100010011111001 |
3 | 11210212122022001220221 |
4 | 232313012010103321 |
5 | 1311022003230210 |
6 | 35040504220041 |
7 | 3430613602315 |
oct | 566706042371 |
9 | 153778261827 |
10 | 50316461305 |
11 | 1a380370120 |
12 | 9902a6a621 |
13 | 498b4b2336 |
14 | 261478ab45 |
15 | 14975561da |
hex | bb71844f9 |
50316461305 has 16 divisors (see below), whose sum is σ = 67993625088. Its totient is φ = 35413344000.
The previous prime is 50316461291. The next prime is 50316461311.
50316461305 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 50316461305 - 233 = 41726526713 is a prime.
It is a Duffinian 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 15 ways as a sum of consecutive naturals, for example, 14753856 + ... + 14757265.
It is an arithmetic number, because the mean of its divisors is an integer number (4249601568).
Almost surely, 250316461305 is an apocalyptic number.
50316461305 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50316461305 is a deficient number, since it is larger than the sum of its proper divisors (17677163783).
50316461305 is a wasteful number, since it uses less digits than its factorization.
50316461305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29511168.
The product of its (nonzero) digits is 32400, while the sum is 34.
The spelling of 50316461305 in words is "fifty billion, three hundred sixteen million, four hundred sixty-one thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •