Base | Representation |
---|---|
bin | 101001000110110… |
… | …010111101000011 |
3 | 1210001200201102022 |
4 | 221012302331003 |
5 | 2403022204202 |
6 | 152233312055 |
7 | 23042622620 |
oct | 5106627503 |
9 | 1701621368 |
10 | 689647427 |
11 | 324319357 |
12 | 172b6562b |
13 | acb56201 |
14 | 67841347 |
15 | 40829ea2 |
hex | 291b2f43 |
689647427 has 16 divisors (see below), whose sum is σ = 830711040. Its totient is φ = 559299168.
The previous prime is 689647423. The next prime is 689647447. The reversal of 689647427 is 724746986.
689647427 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 689647427 - 22 = 689647423 is a prime.
It is a super-2 number, since 2×6896474272 = 951227147135440658, which contains 22 as substring.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (689647423) 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, 117773 + ... + 123489.
It is an arithmetic number, because the mean of its divisors is an integer number (51919440).
Almost surely, 2689647427 is an apocalyptic number.
689647427 is a deficient number, since it is larger than the sum of its proper divisors (141063613).
689647427 is a wasteful number, since it uses less digits than its factorization.
689647427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6650.
The product of its digits is 4064256, while the sum is 53.
The square root of 689647427 is about 26261.1391032453. The cubic root of 689647427 is about 883.5050578522.
The spelling of 689647427 in words is "six hundred eighty-nine million, six hundred forty-seven thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •