Base | Representation |
---|---|
bin | 11101110111001… |
… | …010101101110000 |
3 | 1021220201111021021 |
4 | 131313022231300 |
5 | 2011224013242 |
6 | 121414105224 |
7 | 15262303345 |
oct | 3567125560 |
9 | 1256644237 |
10 | 501001072 |
11 | 237890580 |
12 | 11b94b214 |
13 | 7ca45950 |
14 | 4a7767cc |
15 | 2deb4b67 |
hex | 1ddcab70 |
501001072 has 40 divisors (see below), whose sum is σ = 1140395760. Its totient is φ = 210209280.
The previous prime is 501001049. The next prime is 501001073. The reversal of 501001072 is 270100105.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (501001073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 107197 + ... + 111772.
It is an arithmetic number, because the mean of its divisors is an integer number (28509894).
Almost surely, 2501001072 is an apocalyptic number.
501001072 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
501001072 is an abundant number, since it is smaller than the sum of its proper divisors (639394688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
501001072 is a wasteful number, since it uses less digits than its factorization.
501001072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219001 (or 218995 counting only the distinct ones).
The product of its (nonzero) digits is 70, while the sum is 16.
The square root of 501001072 is about 22383.0532323005. The cubic root of 501001072 is about 794.2298737796.
Adding to 501001072 its reverse (270100105), we get a palindrome (771101177).
The spelling of 501001072 in words is "five hundred one million, one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •