Base | Representation |
---|---|
bin | 1100101111000110110101… |
… | …1111110101010101011111 |
3 | 1211120201022010220200121001 |
4 | 3023301231133311111133 |
5 | 3313413011143241211 |
6 | 45441030453251131 |
7 | 2643500026563106 |
oct | 313615537652537 |
9 | 54521263820531 |
10 | 14003430446431 |
11 | 4509904466888 |
12 | 16a1b60633aa7 |
13 | 7a7696879cca |
14 | 365aabcc303d |
15 | 1943dc16bac1 |
hex | cbc6d7f555f |
14003430446431 has 2 divisors, whose sum is σ = 14003430446432. Its totient is φ = 14003430446430.
The previous prime is 14003430446429. The next prime is 14003430446441. The reversal of 14003430446431 is 13464403430041.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14003430446431 - 21 = 14003430446429 is a prime.
It is a super-2 number, since 2×140034304464312 (a number of 27 digits) contains 22 as substring.
Together with 14003430446429, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14003430446441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7001715223215 + 7001715223216.
It is an arithmetic number, because the mean of its divisors is an integer number (7001715223216).
Almost surely, 214003430446431 is an apocalyptic number.
14003430446431 is a deficient number, since it is larger than the sum of its proper divisors (1).
14003430446431 is an equidigital number, since it uses as much as digits as its factorization.
14003430446431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 165888, while the sum is 37.
Adding to 14003430446431 its reverse (13464403430041), we get a palindrome (27467833876472).
The spelling of 14003430446431 in words is "fourteen trillion, three billion, four hundred thirty million, four hundred forty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •