Base | Representation |
---|---|
bin | 10100011000111110111… |
… | …000111001111001101001 |
3 | 11221221210001011220020102 |
4 | 110120332320321321221 |
5 | 140424141344134423 |
6 | 2551413052235145 |
7 | 203143254151352 |
oct | 24307670717151 |
9 | 4857701156212 |
10 | 1401214443113 |
11 | 4a0285029391 |
12 | 1a7693a6bab5 |
13 | a21983b7374 |
14 | 4bb67a18d29 |
15 | 266aea9ec28 |
hex | 1463ee39e69 |
1401214443113 has 2 divisors, whose sum is σ = 1401214443114. Its totient is φ = 1401214443112.
The previous prime is 1401214443091. The next prime is 1401214443137. The reversal of 1401214443113 is 3113444121041.
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., 1385924626009 + 15289817104 = 1177253^2 + 123652^2 .
It is a cyclic number.
It is not a de Polignac number, because 1401214443113 - 236 = 1332494966377 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1401214443313) 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, 700607221556 + 700607221557.
It is an arithmetic number, because the mean of its divisors is an integer number (700607221557).
Almost surely, 21401214443113 is an apocalyptic number.
It is an amenable number.
1401214443113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1401214443113 is an equidigital number, since it uses as much as digits as its factorization.
1401214443113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 1401214443113 its reverse (3113444121041), we get a palindrome (4514658564154).
The spelling of 1401214443113 in words is "one trillion, four hundred one billion, two hundred fourteen million, four hundred forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •