Base | Representation |
---|---|
bin | 10111111111011… |
… | …000000101001011 |
3 | 1001001100121001000 |
4 | 113333120011023 |
5 | 1311014132200 |
6 | 103534430043 |
7 | 12655051200 |
oct | 2777300513 |
9 | 1031317030 |
10 | 402489675 |
11 | 1972164a5 |
12 | b2962323 |
13 | 65503893 |
14 | 3b651ca7 |
15 | 25506300 |
hex | 17fd814b |
402489675 has 144 divisors (see below), whose sum is σ = 883217280. Its totient is φ = 179081280.
The previous prime is 402489667. The next prime is 402489679. The reversal of 402489675 is 576984204.
It is a happy number.
It is not a de Polignac number, because 402489675 - 23 = 402489667 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 402489675.
It is not an unprimeable number, because it can be changed into a prime (402489679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 1422084 + ... + 1422366.
Almost surely, 2402489675 is an apocalyptic number.
402489675 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
402489675 is an abundant number, since it is smaller than the sum of its proper divisors (480727605).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
402489675 is a wasteful number, since it uses less digits than its factorization.
402489675 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 359 (or 341 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The square root of 402489675 is about 20062.1453239677. The cubic root of 402489675 is about 738.3318125864.
The spelling of 402489675 in words is "four hundred two million, four hundred eighty-nine thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •