Base | Representation |
---|---|
bin | 1110101110001000100… |
… | …01001100111111000001 |
3 | 1210100120100111100121101 |
4 | 13113010101030333001 |
5 | 31241341312030401 |
6 | 1024210235254401 |
7 | 51354203132431 |
oct | 7270421147701 |
9 | 1710510440541 |
10 | 505804017601 |
11 | 1855681aa863 |
12 | 820408aa401 |
13 | 3890a73810c |
14 | 1a6a3db82c1 |
15 | d255457101 |
hex | 75c444cfc1 |
505804017601 has 27 divisors (see below), whose sum is σ = 524074965609. Its totient is φ = 488166993600.
The previous prime is 505804017599. The next prime is 505804017613. The reversal of 505804017601 is 106710408505.
The square root of 505804017601 is 711199.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 327871905201 + 177932112400 = 572601^2 + 421820^2 .
It is not a de Polignac number, because 505804017601 - 21 = 505804017599 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (505804017661) 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 26 ways as a sum of consecutive naturals, for example, 3861099306 + ... + 3861099436.
Almost surely, 2505804017601 is an apocalyptic number.
505804017601 is the 711199-th square number.
505804017601 is the 355600-th centered octagonal number.
It is an amenable number.
505804017601 is a deficient number, since it is larger than the sum of its proper divisors (18270948008).
505804017601 is an frugal number, since it uses more digits than its factorization.
505804017601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562 (or 281 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 37.
The spelling of 505804017601 in words is "five hundred five billion, eight hundred four million, seventeen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •