Base | Representation |
---|---|
bin | 1011101101100110111… |
… | …11010111110001101001 |
3 | 1102110202222002002001002 |
4 | 11312303133113301221 |
5 | 23043200441212131 |
6 | 504514020404345 |
7 | 41034630433262 |
oct | 5666337276151 |
9 | 1373688062032 |
10 | 402443304041 |
11 | 145747831939 |
12 | 65bb55466b5 |
13 | 2bc478a968c |
14 | 1569a895969 |
15 | a7061756cb |
hex | 5db37d7c69 |
402443304041 has 2 divisors, whose sum is σ = 402443304042. Its totient is φ = 402443304040.
The previous prime is 402443304031. The next prime is 402443304059. The reversal of 402443304041 is 140403344204.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 402051105625 + 392198416 = 634075^2 + 19804^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-402443304041 is a prime.
It is a super-2 number, since 2×4024433040412 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 402443303995 and 402443304013.
It is not a weakly prime, because it can be changed into another prime (402443304031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 201221652020 + 201221652021.
It is an arithmetic number, because the mean of its divisors is an integer number (201221652021).
Almost surely, 2402443304041 is an apocalyptic number.
It is an amenable number.
402443304041 is a deficient number, since it is larger than the sum of its proper divisors (1).
402443304041 is an equidigital number, since it uses as much as digits as its factorization.
402443304041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 29.
Adding to 402443304041 its reverse (140403344204), we get a palindrome (542846648245).
The spelling of 402443304041 in words is "four hundred two billion, four hundred forty-three million, three hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •