Base | Representation |
---|---|
bin | 101110111111010111… |
… | …101101000101110001 |
3 | 11211020022112221020220 |
4 | 232333113231011301 |
5 | 1311313024140023 |
6 | 35102344123253 |
7 | 3434220665220 |
oct | 567727550561 |
9 | 154208487226 |
10 | 50455302513 |
11 | 1a441780620 |
12 | 9941466529 |
13 | 49b11a50b5 |
14 | 2628daccb7 |
15 | 14a482e3e3 |
hex | bbf5ed171 |
50455302513 has 32 divisors (see below), whose sum is σ = 84884308992. Its totient is φ = 25894747200.
The previous prime is 50455302463. The next prime is 50455302563. The reversal of 50455302513 is 31520355405.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (50455302463) and next prime (50455302563).
It is not a de Polignac number, because 50455302513 - 28 = 50455302257 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50455302563) 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 31 ways as a sum of consecutive naturals, for example, 1296618 + ... + 1334963.
It is an arithmetic number, because the mean of its divisors is an integer number (2652634656).
Almost surely, 250455302513 is an apocalyptic number.
It is an amenable number.
50455302513 is a deficient number, since it is larger than the sum of its proper divisors (34429006479).
50455302513 is a wasteful number, since it uses less digits than its factorization.
50455302513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2631685.
The product of its (nonzero) digits is 45000, while the sum is 33.
Adding to 50455302513 its reverse (31520355405), we get a palindrome (81975657918).
The spelling of 50455302513 in words is "fifty billion, four hundred fifty-five million, three hundred two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •