Base | Representation |
---|---|
bin | 1000001111010… |
… | …01100010111001 |
3 | 11211001100122022 |
4 | 10013221202321 |
5 | 120143122131 |
6 | 10505204225 |
7 | 1466313443 |
oct | 407514271 |
9 | 154040568 |
10 | 69114041 |
11 | 36016447 |
12 | 1b190675 |
13 | 1141b4a9 |
14 | 9271493 |
15 | 610337b |
hex | 41e98b9 |
69114041 has 2 divisors, whose sum is σ = 69114042. Its totient is φ = 69114040.
The previous prime is 69114013. The next prime is 69114043. The reversal of 69114041 is 14041196.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56190016 + 12924025 = 7496^2 + 3595^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-69114041 is a prime.
Together with 69114043, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 69114041.
It is not a weakly prime, because it can be changed into another prime (69114043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34557020 + 34557021.
It is an arithmetic number, because the mean of its divisors is an integer number (34557021).
Almost surely, 269114041 is an apocalyptic number.
It is an amenable number.
69114041 is a deficient number, since it is larger than the sum of its proper divisors (1).
69114041 is an equidigital number, since it uses as much as digits as its factorization.
69114041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The square root of 69114041 is about 8313.4854904547. The cubic root of 69114041 is about 410.3824331752.
The spelling of 69114041 in words is "sixty-nine million, one hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •