Base | Representation |
---|---|
bin | 11110001010100… |
… | …111100101100101 |
3 | 1022021022112210000 |
4 | 132022213211211 |
5 | 2014030200234 |
6 | 122115251513 |
7 | 15353531256 |
oct | 3612474545 |
9 | 1267275700 |
10 | 506100069 |
11 | 23a753522 |
12 | 1215a9b99 |
13 | 80b0c7c7 |
14 | 4b302b2d |
15 | 2e670899 |
hex | 1e2a7965 |
506100069 has 10 divisors (see below), whose sum is σ = 756026150. Its totient is φ = 337399992.
The previous prime is 506100041. The next prime is 506100071. The reversal of 506100069 is 960001605.
It can be written as a sum of positive squares in only one way, i.e., 326271969 + 179828100 = 18063^2 + 13410^2 .
It is not a de Polignac number, because 506100069 - 28 = 506099813 is a prime.
It is a super-2 number, since 2×5061000692 = 512274559683609522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 (506104069) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3123994 + ... + 3124155.
It is an arithmetic number, because the mean of its divisors is an integer number (75602615).
Almost surely, 2506100069 is an apocalyptic number.
It is an amenable number.
506100069 is a deficient number, since it is larger than the sum of its proper divisors (249926081).
506100069 is an equidigital number, since it uses as much as digits as its factorization.
506100069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6248161 (or 6248152 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 506100069 is about 22496.6679532770. The cubic root of 506100069 is about 796.9152398780.
The spelling of 506100069 in words is "five hundred six million, one hundred thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •