Base | Representation |
---|---|
bin | 1100101111100100001101… |
… | …1010000000110111110101 |
3 | 1211121110122120121111022001 |
4 | 3023321003122000313311 |
5 | 3314030132414243331 |
6 | 45444413041535301 |
7 | 2644166266515265 |
oct | 313710332006765 |
9 | 54543576544261 |
10 | 14011314212341 |
11 | 451218a6648a6 |
12 | 16a35a0944531 |
13 | 7a8351cb4354 |
14 | 366218d717a5 |
15 | 1946ee357561 |
hex | cbe43680df5 |
14011314212341 has 2 divisors, whose sum is σ = 14011314212342. Its totient is φ = 14011314212340.
The previous prime is 14011314212321. The next prime is 14011314212351. The reversal of 14011314212341 is 14321241311041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13004209638225 + 1007104574116 = 3606135^2 + 1003546^2 .
It is a cyclic number.
It is not a de Polignac number, because 14011314212341 - 27 = 14011314212213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14011314212321) 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, 7005657106170 + 7005657106171.
It is an arithmetic number, because the mean of its divisors is an integer number (7005657106171).
Almost surely, 214011314212341 is an apocalyptic number.
It is an amenable number.
14011314212341 is a deficient number, since it is larger than the sum of its proper divisors (1).
14011314212341 is an equidigital number, since it uses as much as digits as its factorization.
14011314212341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 14011314212341 its reverse (14321241311041), we get a palindrome (28332555523382).
The spelling of 14011314212341 in words is "fourteen trillion, eleven billion, three hundred fourteen million, two hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •