Base | Representation |
---|---|
bin | 10111111110101… |
… | …110111111111001 |
3 | 1001001001001012122 |
4 | 113332232333321 |
5 | 1310443241101 |
6 | 103531051025 |
7 | 12653450456 |
oct | 2776567771 |
9 | 1031031178 |
10 | 402321401 |
11 | 197111029 |
12 | b28a0a75 |
13 | 65475101 |
14 | 3b60a82d |
15 | 254c151b |
hex | 17faeff9 |
402321401 has 2 divisors, whose sum is σ = 402321402. Its totient is φ = 402321400.
The previous prime is 402321389. The next prime is 402321427. The reversal of 402321401 is 104123204.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 333099001 + 69222400 = 18251^2 + 8320^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-402321401 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 402321401.
It is not a weakly prime, because it can be changed into another prime (402321301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 201160700 + 201160701.
It is an arithmetic number, because the mean of its divisors is an integer number (201160701).
Almost surely, 2402321401 is an apocalyptic number.
It is an amenable number.
402321401 is a deficient number, since it is larger than the sum of its proper divisors (1).
402321401 is an equidigital number, since it uses as much as digits as its factorization.
402321401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 402321401 is about 20057.9510668463. The cubic root of 402321401 is about 738.2289036394.
Adding to 402321401 its reverse (104123204), we get a palindrome (506444605).
The spelling of 402321401 in words is "four hundred two million, three hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •