Base | Representation |
---|---|
bin | 11110000110101… |
… | …001111010001100 |
3 | 1022012100202110010 |
4 | 132012221322030 |
5 | 2013243423004 |
6 | 122041113220 |
7 | 15341643030 |
oct | 3606517214 |
9 | 1265322403 |
10 | 505061004 |
11 | 23a103898 |
12 | 121188810 |
13 | 80837886 |
14 | 4b1121c0 |
15 | 2e517a89 |
hex | 1e1a9e8c |
505061004 has 96 divisors (see below), whose sum is σ = 1384588800. Its totient is φ = 140313600.
The previous prime is 505061003. The next prime is 505061033. The reversal of 505061004 is 400160505.
It is a happy number.
It is a super-2 number, since 2×5050610042 = 510173235522976032, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (505061003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 500052 + ... + 501060.
It is an arithmetic number, because the mean of its divisors is an integer number (14422800).
Almost surely, 2505061004 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 505061004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (692294400).
505061004 is an abundant number, since it is smaller than the sum of its proper divisors (879527796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505061004 is a wasteful number, since it uses less digits than its factorization.
505061004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1183 (or 1181 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 505061004 is about 22473.5623344409. The cubic root of 505061004 is about 796.3694887414.
The spelling of 505061004 in words is "five hundred five million, sixty-one thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •