Base | Representation |
---|---|
bin | 11001100011101… |
… | …000001010101101 |
3 | 1002212210202211002 |
4 | 121203220022231 |
5 | 1334231114330 |
6 | 110314010045 |
7 | 13424325131 |
oct | 3143501255 |
9 | 1085722732 |
10 | 428769965 |
11 | 200036248 |
12 | bb716925 |
13 | 6aaa5750 |
14 | 40d333c1 |
15 | 27997e45 |
hex | 198e82ad |
428769965 has 8 divisors (see below), whose sum is σ = 554102808. Its totient is φ = 316630080.
The previous prime is 428769919. The next prime is 428770003. The reversal of 428769965 is 569967824.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1190281 + 427579684 = 1091^2 + 20678^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 428769965 - 28 = 428769709 is a prime.
It is a super-2 number, since 2×4287699652 = 367687365772202450, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 428769965.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3298166 + ... + 3298295.
It is an arithmetic number, because the mean of its divisors is an integer number (69262851).
Almost surely, 2428769965 is an apocalyptic number.
It is an amenable number.
428769965 is a deficient number, since it is larger than the sum of its proper divisors (125332843).
428769965 is a wasteful number, since it uses less digits than its factorization.
428769965 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6596479.
The product of its digits is 6531840, while the sum is 56.
The square root of 428769965 is about 20706.7613353706. The cubic root of 428769965 is about 754.0638456257.
The spelling of 428769965 in words is "four hundred twenty-eight million, seven hundred sixty-nine thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •