Base | Representation |
---|---|
bin | 1101000001110001111101… |
… | …0110010010100100011001 |
3 | 1212201101101001012112012122 |
4 | 3100130133112102210121 |
5 | 3334142021404302311 |
6 | 50244244343351025 |
7 | 3005615031642164 |
oct | 320343726224431 |
9 | 55641331175178 |
10 | 14324241869081 |
11 | 4622971114a31 |
12 | 1734173752475 |
13 | 7cba02205691 |
14 | 377422daaadb |
15 | 19c9169280db |
hex | d071f592919 |
14324241869081 has 2 divisors, whose sum is σ = 14324241869082. Its totient is φ = 14324241869080.
The previous prime is 14324241869051. The next prime is 14324241869107. The reversal of 14324241869081 is 18096814242341.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12237543168400 + 2086698700681 = 3498220^2 + 1444541^2 .
It is an emirp because it is prime and its reverse (18096814242341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14324241869081 - 242 = 9926195357977 is a prime.
It is a super-2 number, since 2×143242418690812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14324241869051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7162120934540 + 7162120934541.
It is an arithmetic number, because the mean of its divisors is an integer number (7162120934541).
Almost surely, 214324241869081 is an apocalyptic number.
It is an amenable number.
14324241869081 is a deficient number, since it is larger than the sum of its proper divisors (1).
14324241869081 is an equidigital number, since it uses as much as digits as its factorization.
14324241869081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2654208, while the sum is 53.
The spelling of 14324241869081 in words is "fourteen trillion, three hundred twenty-four billion, two hundred forty-one million, eight hundred sixty-nine thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •