Base | Representation |
---|---|
bin | 1100111010100100100111… |
… | …1111110101111010001111 |
3 | 1212021112201112012002212111 |
4 | 3032221021333311322033 |
5 | 3330124411224300411 |
6 | 50111324130244451 |
7 | 2663642142633364 |
oct | 316511177657217 |
9 | 55245645162774 |
10 | 14200403353231 |
11 | 45853a2542067 |
12 | 1714172426727 |
13 | 7c01279b9a74 |
14 | 371435d4846b |
15 | 1995b9999721 |
hex | cea49ff5e8f |
14200403353231 has 2 divisors, whose sum is σ = 14200403353232. Its totient is φ = 14200403353230.
The previous prime is 14200403353139. The next prime is 14200403353237. The reversal of 14200403353231 is 13235330400241.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14200403353231 - 239 = 13650647539343 is a prime.
It is a super-2 number, since 2×142004033532312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14200403353193 and 14200403353202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14200403353237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7100201676615 + 7100201676616.
It is an arithmetic number, because the mean of its divisors is an integer number (7100201676616).
Almost surely, 214200403353231 is an apocalyptic number.
14200403353231 is a deficient number, since it is larger than the sum of its proper divisors (1).
14200403353231 is an equidigital number, since it uses as much as digits as its factorization.
14200403353231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 14200403353231 its reverse (13235330400241), we get a palindrome (27435733753472).
The spelling of 14200403353231 in words is "fourteen trillion, two hundred billion, four hundred three million, three hundred fifty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •