Base | Representation |
---|---|
bin | 1111100000000… |
… | …0000100000001 |
3 | 11112022221122201 |
4 | 3320000010001 |
5 | 113120340334 |
6 | 10241233201 |
7 | 1416410161 |
oct | 370000401 |
9 | 145287581 |
10 | 65011969 |
11 | 33774500 |
12 | 19932801 |
13 | 10613329 |
14 | 88c45a1 |
15 | 5a92c14 |
hex | 3e00101 |
65011969 has 9 divisors (see below), whose sum is σ = 71557059. Its totient is φ = 59021160.
The previous prime is 65011963. The next prime is 65011981. The reversal of 65011969 is 96911056.
The square root of 65011969 is 8063.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 63600625 + 1411344 = 7975^2 + 1188^2 .
It is not a de Polignac number, because 65011969 - 27 = 65011841 is a prime.
It is a super-2 number, since 2×650119692 = 8453112226513922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (65011963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 88327 + ... + 89059.
Almost surely, 265011969 is an apocalyptic number.
65011969 is the 8063-rd square number.
65011969 is the 4032-nd centered octagonal number.
It is an amenable number.
65011969 is a deficient number, since it is larger than the sum of its proper divisors (6545090).
65011969 is an frugal number, since it uses more digits than its factorization.
65011969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1488 (or 744 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 37.
The cubic root of 65011969 is about 402.0972533528.
The spelling of 65011969 in words is "sixty-five million, eleven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •