Base | Representation |
---|---|
bin | 10100011001110110010… |
… | …100100011111011101001 |
3 | 11222001011212010122012002 |
4 | 110121312110203323221 |
5 | 140433042434040131 |
6 | 2552045233300345 |
7 | 203205306043562 |
oct | 24316624437351 |
9 | 4861155118162 |
10 | 1402144440041 |
11 | 4a0711a89894 |
12 | 1a78b34046b5 |
13 | a22b5c844c7 |
14 | 4bc15343169 |
15 | 267165546cb |
hex | 14676523ee9 |
1402144440041 has 2 divisors, whose sum is σ = 1402144440042. Its totient is φ = 1402144440040.
The previous prime is 1402144439977. The next prime is 1402144440061. The reversal of 1402144440041 is 1400444412041.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 701582136025 + 700562304016 = 837605^2 + 836996^2 .
It is a cyclic number.
It is not a de Polignac number, because 1402144440041 - 26 = 1402144439977 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1402144439986 and 1402144440013.
It is not a weakly prime, because it can be changed into another prime (1402144440061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 701072220020 + 701072220021.
It is an arithmetic number, because the mean of its divisors is an integer number (701072220021).
Almost surely, 21402144440041 is an apocalyptic number.
It is an amenable number.
1402144440041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1402144440041 is an equidigital number, since it uses as much as digits as its factorization.
1402144440041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8192, while the sum is 29.
Adding to 1402144440041 its reverse (1400444412041), we get a palindrome (2802588852082).
The spelling of 1402144440041 in words is "one trillion, four hundred two billion, one hundred forty-four million, four hundred forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •