Base | Representation |
---|---|
bin | 1101000001000000101010… |
… | …1110111101000100011001 |
3 | 1212200010012222012101102201 |
4 | 3100100022232331010121 |
5 | 3333432422321024233 |
6 | 50234215430330201 |
7 | 3004636124234056 |
oct | 320201256750431 |
9 | 55603188171381 |
10 | 14311011111193 |
11 | 46182a1759785 |
12 | 17316a07b9961 |
13 | 7ca6a409a764 |
14 | 376929b3402d |
15 | 19c3e00e377d |
hex | d040abbd119 |
14311011111193 has 2 divisors, whose sum is σ = 14311011111194. Its totient is φ = 14311011111192.
The previous prime is 14311011111179. The next prime is 14311011111283. The reversal of 14311011111193 is 39111111011341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8472273454089 + 5838737657104 = 2910717^2 + 2416348^2 .
It is a cyclic number.
It is not a de Polignac number, because 14311011111193 - 25 = 14311011111161 is a prime.
It is not a weakly prime, because it can be changed into another prime (14311011111143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7155505555596 + 7155505555597.
It is an arithmetic number, because the mean of its divisors is an integer number (7155505555597).
Almost surely, 214311011111193 is an apocalyptic number.
It is an amenable number.
14311011111193 is a deficient number, since it is larger than the sum of its proper divisors (1).
14311011111193 is an equidigital number, since it uses as much as digits as its factorization.
14311011111193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 28.
The spelling of 14311011111193 in words is "fourteen trillion, three hundred eleven billion, eleven million, one hundred eleven thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •