Base | Representation |
---|---|
bin | 1101000100001010111101… |
… | …0000110110000000010101 |
3 | 1212212022101020010220022221 |
4 | 3101002233100312000111 |
5 | 3340330124113104013 |
6 | 50315155515022341 |
7 | 3011600541234436 |
oct | 321025720660025 |
9 | 55768336126287 |
10 | 14365311066133 |
11 | 46393266595a5 |
12 | 174011573a9b1 |
13 | 802848942301 |
14 | 3793db57948d |
15 | 19da1c20e08d |
hex | d10af436015 |
14365311066133 has 2 divisors, whose sum is σ = 14365311066134. Its totient is φ = 14365311066132.
The previous prime is 14365311066109. The next prime is 14365311066137. The reversal of 14365311066133 is 33166011356341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10573695965284 + 3791615100849 = 3251722^2 + 1947207^2 .
It is an emirp because it is prime and its reverse (33166011356341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14365311066133 - 225 = 14365277511701 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14365311066133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14365311066137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7182655533066 + 7182655533067.
It is an arithmetic number, because the mean of its divisors is an integer number (7182655533067).
Almost surely, 214365311066133 is an apocalyptic number.
It is an amenable number.
14365311066133 is a deficient number, since it is larger than the sum of its proper divisors (1).
14365311066133 is an equidigital number, since it uses as much as digits as its factorization.
14365311066133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 349920, while the sum is 43.
The spelling of 14365311066133 in words is "fourteen trillion, three hundred sixty-five billion, three hundred eleven million, sixty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •