Base | Representation |
---|---|
bin | 101110110101110100… |
… | …110101101111111101 |
3 | 11210211011020020222220 |
4 | 232311310311233331 |
5 | 1311001030333442 |
6 | 35034423555553 |
7 | 3430234605564 |
oct | 566564655775 |
9 | 153734206886 |
10 | 50295167997 |
11 | 1a36a347148 |
12 | 98b78bbbb9 |
13 | 4986c68349 |
14 | 2611a06bdb |
15 | 149574beec |
hex | bb5d35bfd |
50295167997 has 4 divisors (see below), whose sum is σ = 67060224000. Its totient is φ = 33530111996.
The previous prime is 50295167971. The next prime is 50295168023. The reversal of 50295167997 is 79976159205.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (50295167971) and next prime (50295168023).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50295167997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50295167997.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50295167917) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8382527997 + ... + 8382528002.
It is an arithmetic number, because the mean of its divisors is an integer number (16765056000).
Almost surely, 250295167997 is an apocalyptic number.
It is an amenable number.
50295167997 is a deficient number, since it is larger than the sum of its proper divisors (16765056003).
50295167997 is a wasteful number, since it uses less digits than its factorization.
50295167997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16765056002.
The product of its (nonzero) digits is 10716300, while the sum is 60.
The spelling of 50295167997 in words is "fifty billion, two hundred ninety-five million, one hundred sixty-seven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •