Base | Representation |
---|---|
bin | 1110100011010100111… |
… | …00010100101110011101 |
3 | 1202210121000000010220000 |
4 | 13101222130110232131 |
5 | 31143001004004112 |
6 | 1021410414244513 |
7 | 51060342004350 |
oct | 7215234245635 |
9 | 1683530003800 |
10 | 500002016157 |
11 | 183060115246 |
12 | 80aa17b6739 |
13 | 381c46a5677 |
14 | 1a2b35ca297 |
15 | d015dd07dc |
hex | 746a714b9d |
500002016157 has 40 divisors (see below), whose sum is σ = 883054128000. Its totient is φ = 275863172256.
The previous prime is 500002016131. The next prime is 500002016159. The reversal of 500002016157 is 751610200005.
500002016157 is a `hidden beast` number, since 500 + 0 + 0 + 2 + 0 + 1 + 6 + 157 = 666.
It is not a de Polignac number, because 500002016157 - 215 = 500001983389 is a prime.
It is a super-2 number, since 2×5000020161572 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 500002016157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (500002016159) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 15187657 + ... + 15220542.
It is an arithmetic number, because the mean of its divisors is an integer number (22076353200).
Almost surely, 2500002016157 is an apocalyptic number.
It is an amenable number.
500002016157 is a deficient number, since it is larger than the sum of its proper divisors (383052111843).
500002016157 is a wasteful number, since it uses less digits than its factorization.
500002016157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30408247 (or 30408238 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The spelling of 500002016157 in words is "five hundred billion, two million, sixteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •