Base | Representation |
---|---|
bin | 1011101101111101011… |
… | …10001111000110101101 |
3 | 1102111021002200010101022 |
4 | 11312332232033012231 |
5 | 23044042212000221 |
6 | 504544431423525 |
7 | 41042406256502 |
oct | 5667656170655 |
9 | 1374232603338 |
10 | 402631750061 |
11 | 145834143152 |
12 | 66048684ba5 |
13 | 2bc779499b8 |
14 | 156b790b4a9 |
15 | a71799b4ab |
hex | 5dbeb8f1ad |
402631750061 has 2 divisors, whose sum is σ = 402631750062. Its totient is φ = 402631750060.
The previous prime is 402631750019. The next prime is 402631750063. The reversal of 402631750061 is 160057136204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 269246832100 + 133384917961 = 518890^2 + 365219^2 .
It is a cyclic number.
It is not a de Polignac number, because 402631750061 - 214 = 402631733677 is a prime.
It is a super-2 number, since 2×4026317500612 (a number of 24 digits) contains 22 as substring.
Together with 402631750063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (402631750063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 201315875030 + 201315875031.
It is an arithmetic number, because the mean of its divisors is an integer number (201315875031).
Almost surely, 2402631750061 is an apocalyptic number.
It is an amenable number.
402631750061 is a deficient number, since it is larger than the sum of its proper divisors (1).
402631750061 is an equidigital number, since it uses as much as digits as its factorization.
402631750061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 35.
Adding to 402631750061 its reverse (160057136204), we get a palindrome (562688886265).
The spelling of 402631750061 in words is "four hundred two billion, six hundred thirty-one million, seven hundred fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •