Base | Representation |
---|---|
bin | 11110000110100… |
… | …100110010000000 |
3 | 1022012022200122012 |
4 | 132012210302000 |
5 | 2013242240000 |
6 | 122040432052 |
7 | 15341524553 |
oct | 3606446200 |
9 | 1265280565 |
10 | 505040000 |
11 | 23a09a033 |
12 | 121178628 |
13 | 8082b14a |
14 | 4b10869a |
15 | 2e511735 |
hex | 1e1a4c80 |
505040000 has 160 divisors (see below), whose sum is σ = 1290524400. Its totient is φ = 196736000.
The previous prime is 505039999. The next prime is 505040027. The reversal of 505040000 is 40505.
It is a tau number, because it is divible by the number of its divisors (160).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4719947 + ... + 4720053.
Almost surely, 2505040000 is an apocalyptic number.
505040000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 505040000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (645262200).
505040000 is an abundant number, since it is smaller than the sum of its proper divisors (785484400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505040000 is an equidigital number, since it uses as much as digits as its factorization.
505040000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200 (or 173 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 14.
The square root of 505040000 is about 22473.0950249404. The cubic root of 505040000 is about 796.3584490344.
Adding to 505040000 its reverse (40505), we get a palindrome (505080505).
The spelling of 505040000 in words is "five hundred five million, forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •