Base | Representation |
---|---|
bin | 1101000011010010000111… |
… | …0000101000001001010011 |
3 | 1212210211222210202200222111 |
4 | 3100310201300220021103 |
5 | 3340102401321201121 |
6 | 50304153431050151 |
7 | 3010520445361333 |
oct | 320644160501123 |
9 | 55724883680874 |
10 | 14350052131411 |
11 | 4632906361047 |
12 | 1739177510957 |
13 | 801286575b59 |
14 | 378790bd10c3 |
15 | 19d4277ed2e1 |
hex | d0d21c28253 |
14350052131411 has 2 divisors, whose sum is σ = 14350052131412. Its totient is φ = 14350052131410.
The previous prime is 14350052131409. The next prime is 14350052131439. The reversal of 14350052131411 is 11413125005341.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14350052131411 - 21 = 14350052131409 is a prime.
It is a super-3 number, since 3×143500521314113 (a number of 40 digits) contains 333 as substring.
Together with 14350052131409, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (14350052191411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7175026065705 + 7175026065706.
It is an arithmetic number, because the mean of its divisors is an integer number (7175026065706).
Almost surely, 214350052131411 is an apocalyptic number.
14350052131411 is a deficient number, since it is larger than the sum of its proper divisors (1).
14350052131411 is an equidigital number, since it uses as much as digits as its factorization.
14350052131411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 14350052131411 its reverse (11413125005341), we get a palindrome (25763177136752).
The spelling of 14350052131411 in words is "fourteen trillion, three hundred fifty billion, fifty-two million, one hundred thirty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •