Base | Representation |
---|---|
bin | 1000001000110… |
… | …11011000000001 |
3 | 11202110110020120 |
4 | 10010123120001 |
5 | 114434111234 |
6 | 10435130453 |
7 | 1456165434 |
oct | 404333001 |
9 | 152413216 |
10 | 68269569 |
11 | 35599a35 |
12 | 1aa43a29 |
13 | 111b3cc4 |
14 | 90d181b |
15 | 5ed8049 |
hex | 411b601 |
68269569 has 16 divisors (see below), whose sum is σ = 96821568. Its totient is φ = 42639872.
The previous prime is 68269561. The next prime is 68269577. The reversal of 68269569 is 96596286.
It is an interprime number because it is at equal distance from previous prime (68269561) and next prime (68269577).
It is a cyclic number.
It is not a de Polignac number, because 68269569 - 23 = 68269561 is a prime.
It is a super-2 number, since 2×682695692 = 9321468102891522, which contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (68269561) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8629 + ... + 14525.
It is an arithmetic number, because the mean of its divisors is an integer number (6051348).
Almost surely, 268269569 is an apocalyptic number.
It is an amenable number.
68269569 is a deficient number, since it is larger than the sum of its proper divisors (28551999).
68269569 is a wasteful number, since it uses less digits than its factorization.
68269569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6144.
The product of its digits is 1399680, while the sum is 51.
The square root of 68269569 is about 8262.5401058028. The cubic root of 68269569 is about 408.7041557502.
The spelling of 68269569 in words is "sixty-eight million, two hundred sixty-nine thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •