Base | Representation |
---|---|
bin | 1011101101001101101… |
… | …11100110010110101001 |
3 | 1102110020012121221000201 |
4 | 11312212313212112221 |
5 | 23042232234121101 |
6 | 504441014032201 |
7 | 41026446526531 |
oct | 5664667462651 |
9 | 1373205557021 |
10 | 402231551401 |
11 | 145649251a59 |
12 | 65b56648661 |
13 | 2bc12a68b64 |
14 | 1567a6d44c1 |
15 | a6e2798e01 |
hex | 5da6de65a9 |
402231551401 has 2 divisors, whose sum is σ = 402231551402. Its totient is φ = 402231551400.
The previous prime is 402231551387. The next prime is 402231551417. The reversal of 402231551401 is 104155132204.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 370028890000 + 32202661401 = 608300^2 + 179451^2 .
It is a cyclic number.
It is not a de Polignac number, because 402231551401 - 225 = 402197996969 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 402231551401.
It is not a weakly prime, because it can be changed into another prime (402231551201) 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, 201115775700 + 201115775701.
It is an arithmetic number, because the mean of its divisors is an integer number (201115775701).
Almost surely, 2402231551401 is an apocalyptic number.
It is an amenable number.
402231551401 is a deficient number, since it is larger than the sum of its proper divisors (1).
402231551401 is an equidigital number, since it uses as much as digits as its factorization.
402231551401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 402231551401 its reverse (104155132204), we get a palindrome (506386683605).
The spelling of 402231551401 in words is "four hundred two billion, two hundred thirty-one million, five hundred fifty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •