Base | Representation |
---|---|
bin | 1000010001110… |
… | …10001110010001 |
3 | 11211200010221102 |
4 | 10020322032101 |
5 | 120234210442 |
6 | 10520234145 |
7 | 1502161043 |
oct | 410721621 |
9 | 154603842 |
10 | 69444497 |
11 | 36221751 |
12 | 1b30b955 |
13 | 11505a25 |
14 | 9319a93 |
15 | 616b232 |
hex | 423a391 |
69444497 has 2 divisors, whose sum is σ = 69444498. Its totient is φ = 69444496.
The previous prime is 69444491. The next prime is 69444499. The reversal of 69444497 is 79444496.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60824401 + 8620096 = 7799^2 + 2936^2 .
It is a cyclic number.
It is not a de Polignac number, because 69444497 - 24 = 69444481 is a prime.
It is a super-3 number, since 3×694444973 (a number of 25 digits) contains 333 as substring.
Together with 69444499, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (69444491) 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, 34722248 + 34722249.
It is an arithmetic number, because the mean of its divisors is an integer number (34722249).
Almost surely, 269444497 is an apocalyptic number.
It is an amenable number.
69444497 is a deficient number, since it is larger than the sum of its proper divisors (1).
69444497 is an equidigital number, since it uses as much as digits as its factorization.
69444497 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 870912, while the sum is 47.
The square root of 69444497 is about 8333.3364866661. The cubic root of 69444497 is about 411.0354494122.
Subtracting 69444497 from its reverse (79444496), we obtain a palindrome (9999999).
The spelling of 69444497 in words is "sixty-nine million, four hundred forty-four thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •