Base | Representation |
---|---|
bin | 1110101100111001111… |
… | …11010000010111011111 |
3 | 1210021212102102212101101 |
4 | 13112130333100113133 |
5 | 31234014110021224 |
6 | 1024021014253531 |
7 | 51331651444501 |
oct | 7263477202737 |
9 | 1707772385341 |
10 | 505145001439 |
11 | 18525a203201 |
12 | 81a980572a7 |
13 | 38834048320 |
14 | 1a64066bd71 |
15 | d21767d044 |
hex | 759cfd05df |
505145001439 has 32 divisors (see below), whose sum is σ = 571241341440. Its totient is φ = 443632146048.
The previous prime is 505145001421. The next prime is 505145001443. The reversal of 505145001439 is 934100541505.
It is not a de Polignac number, because 505145001439 - 25 = 505145001407 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 505145001398 and 505145001407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505145001139) 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, 4056822 + ... + 4179484.
It is an arithmetic number, because the mean of its divisors is an integer number (17851291920).
Almost surely, 2505145001439 is an apocalyptic number.
505145001439 is a deficient number, since it is larger than the sum of its proper divisors (66096340001).
505145001439 is a wasteful number, since it uses less digits than its factorization.
505145001439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122911.
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 505145001439 in words is "five hundred five billion, one hundred forty-five million, one thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •