Base | Representation |
---|---|
bin | 1110100011010100101… |
… | …10111100001100100001 |
3 | 1202210120220100110002111 |
4 | 13101222112330030201 |
5 | 31143000123324321 |
6 | 1021410324115321 |
7 | 51060324006154 |
oct | 7215226741441 |
9 | 1683526313074 |
10 | 500000604961 |
11 | 18305a340a70 |
12 | 80aa1235b41 |
13 | 381c4300240 |
14 | 1a2b333dc9b |
15 | d015c025e1 |
hex | 746a5bc321 |
500000604961 has 32 divisors (see below), whose sum is σ = 589052943360. Its totient is φ = 418411156800.
The previous prime is 500000604937. The next prime is 500000604967. The reversal of 500000604961 is 169406000005.
It is not a de Polignac number, because 500000604961 - 213 = 500000596769 is a prime.
It is a super-2 number, since 2×5000006049612 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (500000604967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 170124630 + ... + 170127568.
It is an arithmetic number, because the mean of its divisors is an integer number (18407904480).
Almost surely, 2500000604961 is an apocalyptic number.
It is an amenable number.
500000604961 is a deficient number, since it is larger than the sum of its proper divisors (89052338399).
500000604961 is a wasteful number, since it uses less digits than its factorization.
500000604961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5877.
The product of its (nonzero) digits is 6480, while the sum is 31.
Adding to 500000604961 its reverse (169406000005), we get a palindrome (669406604966).
The spelling of 500000604961 in words is "five hundred billion, six hundred four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •