Base | Representation |
---|---|
bin | 11000000000011… |
… | …011001111011001 |
3 | 1001001212120101101 |
4 | 120000123033121 |
5 | 1311101433021 |
6 | 103544351401 |
7 | 12660305200 |
oct | 3000331731 |
9 | 1031776341 |
10 | 402764761 |
11 | 197394143 |
12 | b2a75561 |
13 | 6559bb59 |
14 | 3b6c4237 |
15 | 2555ca91 |
hex | 1801b3d9 |
402764761 has 27 divisors (see below), whose sum is σ = 486679167. Its totient is φ = 332342640.
The previous prime is 402764737. The next prime is 402764773. The reversal of 402764761 is 167467204.
The square root of 402764761 is 20069.
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., 13097161 + 389667600 = 3619^2 + 19740^2 .
It is not a de Polignac number, because 402764761 - 25 = 402764729 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 402764761.
It is not an unprimeable number, because it can be changed into a prime (402768761) by changing a digit.
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 26 ways as a sum of consecutive naturals, for example, 6602671 + ... + 6602731.
Almost surely, 2402764761 is an apocalyptic number.
402764761 is the 20069-th square number.
402764761 is the 10035-th centered octagonal number.
It is an amenable number.
402764761 is a deficient number, since it is larger than the sum of its proper divisors (83914406).
402764761 is an frugal number, since it uses more digits than its factorization.
402764761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230 (or 115 counting only the distinct ones).
The product of its (nonzero) digits is 56448, while the sum is 37.
The cubic root of 402764761 is about 738.4999812822.
The spelling of 402764761 in words is "four hundred two million, seven hundred sixty-four thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •