Base | Representation |
---|---|
bin | 101110101110001111… |
… | …110110111010010011 |
3 | 11210111022000010110011 |
4 | 232232033312322103 |
5 | 1310221004023130 |
6 | 35014043015351 |
7 | 3424132146430 |
oct | 565617667223 |
9 | 153438003404 |
10 | 50168032915 |
11 | 1a304601730 |
12 | 988120a557 |
13 | 49668138a0 |
14 | 25dcb90b87 |
15 | 14894d752a |
hex | bae3f6e93 |
50168032915 has 64 divisors (see below), whose sum is σ = 85084554240. Its totient is φ = 27348503040.
The previous prime is 50168032913. The next prime is 50168032931. The reversal of 50168032915 is 51923086105.
It is not a de Polignac number, because 50168032915 - 21 = 50168032913 is a prime.
It is not an unprimeable number, because it can be changed into a prime (50168032913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 168684 + ... + 358873.
It is an arithmetic number, because the mean of its divisors is an integer number (1329446160).
Almost surely, 250168032915 is an apocalyptic number.
50168032915 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
50168032915 is a deficient number, since it is larger than the sum of its proper divisors (34916521325).
50168032915 is a wasteful number, since it uses less digits than its factorization.
50168032915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527612.
The product of its (nonzero) digits is 64800, while the sum is 40.
The spelling of 50168032915 in words is "fifty billion, one hundred sixty-eight million, thirty-two thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •