Base | Representation |
---|---|
bin | 11110000011011… |
… | …010101101010101 |
3 | 1022010202122020222 |
4 | 132003122231111 |
5 | 2013034243214 |
6 | 122011004125 |
7 | 15331506506 |
oct | 3603325525 |
9 | 1263678228 |
10 | 504212309 |
11 | 239684197 |
12 | 120a39645 |
13 | 805cb4a3 |
14 | 4ad70bad |
15 | 2e3eb38e |
hex | 1e0dab55 |
504212309 has 4 divisors (see below), whose sum is σ = 508838220. Its totient is φ = 499586400.
The previous prime is 504212263. The next prime is 504212311. The reversal of 504212309 is 903212405.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 385336900 + 118875409 = 19630^2 + 10903^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-504212309 is a prime.
It is a super-3 number, since 3×5042123093 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (504212339) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2312792 + ... + 2313009.
It is an arithmetic number, because the mean of its divisors is an integer number (127209555).
Almost surely, 2504212309 is an apocalyptic number.
It is an amenable number.
504212309 is a deficient number, since it is larger than the sum of its proper divisors (4625911).
504212309 is a wasteful number, since it uses less digits than its factorization.
504212309 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4625910.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 504212309 is about 22454.6723200317. The cubic root of 504212309 is about 795.9231705558.
The spelling of 504212309 in words is "five hundred four million, two hundred twelve thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •