Base | Representation |
---|---|
bin | 11101110011111… |
… | …111010111011000 |
3 | 1021212011011201101 |
4 | 131303333113120 |
5 | 2011020340102 |
6 | 121344201144 |
7 | 15252234121 |
oct | 3563772730 |
9 | 1255134641 |
10 | 500168152 |
11 | 237371810 |
12 | 11b6091b4 |
13 | 7c8137b3 |
14 | 4a5db048 |
15 | 2dd9ce87 |
hex | 1dcff5d8 |
500168152 has 64 divisors (see below), whose sum is σ = 1087395840. Its totient is φ = 213158400.
The previous prime is 500168147. The next prime is 500168177. The reversal of 500168152 is 251861005.
It is a self number, because there is not a number n which added to its sum of digits gives 500168152.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 548577 + ... + 549487.
It is an arithmetic number, because the mean of its divisors is an integer number (16990560).
Almost surely, 2500168152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 500168152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (543697920).
500168152 is an abundant number, since it is smaller than the sum of its proper divisors (587227688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
500168152 is a wasteful number, since it uses less digits than its factorization.
500168152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1312 (or 1308 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 28.
The square root of 500168152 is about 22364.4394519514. The cubic root of 500168152 is about 793.7894908990.
It can be divided in two parts, 5001 and 68152, that added together give a triangular number (73153 = T382).
The spelling of 500168152 in words is "five hundred million, one hundred sixty-eight thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •