Base | Representation |
---|---|
bin | 100000000100010… |
… | …011101011000101 |
3 | 1101111100020100111 |
4 | 200010103223011 |
5 | 2100212000234 |
6 | 125215113021 |
7 | 16221632215 |
oct | 4004235305 |
9 | 1344306314 |
10 | 538000069 |
11 | 256761462 |
12 | 130212771 |
13 | 875cb549 |
14 | 51648245 |
15 | 32372664 |
hex | 20113ac5 |
538000069 has 2 divisors, whose sum is σ = 538000070. Its totient is φ = 538000068.
The previous prime is 538000039. The next prime is 538000079. The reversal of 538000069 is 960000835.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 493284100 + 44715969 = 22210^2 + 6687^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-538000069 is a prime.
It is a super-2 number, since 2×5380000692 = 578888148488009522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 538000069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (538000039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 269000034 + 269000035.
It is an arithmetic number, because the mean of its divisors is an integer number (269000035).
Almost surely, 2538000069 is an apocalyptic number.
It is an amenable number.
538000069 is a deficient number, since it is larger than the sum of its proper divisors (1).
538000069 is an equidigital number, since it uses as much as digits as its factorization.
538000069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 31.
The square root of 538000069 is about 23194.8284968870. The cubic root of 538000069 is about 813.3187361701.
The spelling of 538000069 in words is "five hundred thirty-eight million, sixty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •