Base | Representation |
---|---|
bin | 11110001101010… |
… | …010111101111010 |
3 | 1022022122012201000 |
4 | 132031102331322 |
5 | 2014220131132 |
6 | 122142305430 |
7 | 15362513655 |
oct | 3615227572 |
9 | 1268565630 |
10 | 506802042 |
11 | 24009296a |
12 | 121888276 |
13 | 80cc7186 |
14 | 4b44689c |
15 | 2e75d87c |
hex | 1e352f7a |
506802042 has 64 divisors (see below), whose sum is σ = 1164366720. Its totient is φ = 163296000.
The previous prime is 506802031. The next prime is 506802053. The reversal of 506802042 is 240208605.
It is an interprime number because it is at equal distance from previous prime (506802031) and next prime (506802053).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 506801997 and 506802015.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 233442 + ... + 235602.
It is an arithmetic number, because the mean of its divisors is an integer number (18193230).
Almost surely, 2506802042 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 506802042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (582183360).
506802042 is an abundant number, since it is smaller than the sum of its proper divisors (657564678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506802042 is a wasteful number, since it uses less digits than its factorization.
506802042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2316 (or 2310 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 506802042 is about 22512.2642575108. The cubic root of 506802042 is about 797.2835165459.
The spelling of 506802042 in words is "five hundred six million, eight hundred two thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •