Base | Representation |
---|---|
bin | 1101000001100110000000… |
… | …0010000111001101001001 |
3 | 1212201002002100111221212022 |
4 | 3100121200002013031021 |
5 | 3334113433211201101 |
6 | 50242554043454225 |
7 | 3005442345424322 |
oct | 320314002071511 |
9 | 55632070457768 |
10 | 14321032131401 |
11 | 4621574320566 |
12 | 1733618827375 |
13 | 7cb610237808 |
14 | 3771da9a9449 |
15 | 19c7c9c54a1b |
hex | d0660087349 |
14321032131401 has 2 divisors, whose sum is σ = 14321032131402. Its totient is φ = 14321032131400.
The previous prime is 14321032131359. The next prime is 14321032131457. The reversal of 14321032131401 is 10413123012341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10595838765625 + 3725193365776 = 3255125^2 + 1930076^2 .
It is a cyclic number.
It is not a de Polignac number, because 14321032131401 - 218 = 14321031869257 is a prime.
It is a super-2 number, since 2×143210321314012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14321032431401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7160516065700 + 7160516065701.
It is an arithmetic number, because the mean of its divisors is an integer number (7160516065701).
Almost surely, 214321032131401 is an apocalyptic number.
It is an amenable number.
14321032131401 is a deficient number, since it is larger than the sum of its proper divisors (1).
14321032131401 is an equidigital number, since it uses as much as digits as its factorization.
14321032131401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 14321032131401 its reverse (10413123012341), we get a palindrome (24734155143742).
The spelling of 14321032131401 in words is "fourteen trillion, three hundred twenty-one billion, thirty-two million, one hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.449 sec. • engine limits •