Base | Representation |
---|---|
bin | 10111111111011… |
… | …000111011001001 |
3 | 1001001100202202221 |
4 | 113333120323021 |
5 | 1311014240004 |
6 | 103534454041 |
7 | 12655064233 |
oct | 2777307311 |
9 | 1031322687 |
10 | 402493129 |
11 | 197219055 |
12 | b2964321 |
13 | 6550531c |
14 | 3b653253 |
15 | 25507354 |
hex | 17fd8ec9 |
402493129 has 4 divisors (see below), whose sum is σ = 404962576. Its totient is φ = 400023684.
The previous prime is 402493109. The next prime is 402493151. The reversal of 402493129 is 921394204.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 402493129 - 213 = 402484937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 402493094 and 402493103.
It is not an unprimeable number, because it can be changed into a prime (402493109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1234479 + ... + 1234804.
It is an arithmetic number, because the mean of its divisors is an integer number (101240644).
Almost surely, 2402493129 is an apocalyptic number.
It is an amenable number.
402493129 is a deficient number, since it is larger than the sum of its proper divisors (2469447).
402493129 is a wasteful number, since it uses less digits than its factorization.
402493129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2469446.
The product of its (nonzero) digits is 15552, while the sum is 34.
The square root of 402493129 is about 20062.2314063017. The cubic root of 402493129 is about 738.3339245999. Note that the first 3 decimals are identical.
The spelling of 402493129 in words is "four hundred two million, four hundred ninety-three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •