Base | Representation |
---|---|
bin | 1100110000001101010010… |
… | …1110001001100110111001 |
3 | 1211122112010010120100021022 |
4 | 3030003110232021212321 |
5 | 3314220224040400123 |
6 | 45453435224152225 |
7 | 2645036465302166 |
oct | 314032456114671 |
9 | 54575103510238 |
10 | 14022342121913 |
11 | 4516929625554 |
12 | 16a575a008675 |
13 | 7a93bb931328 |
14 | 36698382906d |
15 | 194b475ab1c8 |
hex | cc0d4b899b9 |
14022342121913 has 2 divisors, whose sum is σ = 14022342121914. Its totient is φ = 14022342121912.
The previous prime is 14022342121901. The next prime is 14022342121933. The reversal of 14022342121913 is 31912124322041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12063764263849 + 1958577858064 = 3473293^2 + 1399492^2 .
It is an emirp because it is prime and its reverse (31912124322041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14022342121913 - 210 = 14022342120889 is a prime.
It is not a weakly prime, because it can be changed into another prime (14022342121933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7011171060956 + 7011171060957.
It is an arithmetic number, because the mean of its divisors is an integer number (7011171060957).
Almost surely, 214022342121913 is an apocalyptic number.
It is an amenable number.
14022342121913 is a deficient number, since it is larger than the sum of its proper divisors (1).
14022342121913 is an equidigital number, since it uses as much as digits as its factorization.
14022342121913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 35.
Adding to 14022342121913 its reverse (31912124322041), we get a palindrome (45934466443954).
The spelling of 14022342121913 in words is "fourteen trillion, twenty-two billion, three hundred forty-two million, one hundred twenty-one thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •