Base | Representation |
---|---|
bin | 101001001000101… |
… | …000101101100101 |
3 | 1210002121020001200 |
4 | 221020220231211 |
5 | 2403133123030 |
6 | 152251513113 |
7 | 23050002063 |
oct | 5110505545 |
9 | 1702536050 |
10 | 690129765 |
11 | 324618786 |
12 | 173158799 |
13 | acc94910 |
14 | 67929033 |
15 | 408c2d60 |
hex | 29228b65 |
690129765 has 48 divisors (see below), whose sum is σ = 1291635072. Its totient is φ = 338861952.
The previous prime is 690129679. The next prime is 690129779. The reversal of 690129765 is 567921096.
It is a happy number.
It is not a de Polignac number, because 690129765 - 28 = 690129509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 690129765.
It is a congruent number.
It is an unprimeable number.
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 in 47 ways as a sum of consecutive naturals, for example, 257824 + ... + 260486.
It is an arithmetic number, because the mean of its divisors is an integer number (26909064).
Almost surely, 2690129765 is an apocalyptic number.
690129765 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
690129765 is a deficient number, since it is larger than the sum of its proper divisors (601505307).
690129765 is a wasteful number, since it uses less digits than its factorization.
690129765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3130 (or 3127 counting only the distinct ones).
The product of its (nonzero) digits is 204120, while the sum is 45.
The square root of 690129765 is about 26270.3209915677. The cubic root of 690129765 is about 883.7109837285.
The spelling of 690129765 in words is "six hundred ninety million, one hundred twenty-nine thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •