Base | Representation |
---|---|
bin | 1100111100100010100110… |
… | …1111111010001110111101 |
3 | 1212101210000102000121022111 |
4 | 3033020221233322032331 |
5 | 3331203141320402333 |
6 | 50135040014214021 |
7 | 2666250202025632 |
oct | 317105157721675 |
9 | 55353012017274 |
10 | 14234222044093 |
11 | 4598777293057 |
12 | 171a8301b4311 |
13 | 7c338726184c |
14 | 372d235cc189 |
15 | 19a3e89824cd |
hex | cf229bfa3bd |
14234222044093 has 2 divisors, whose sum is σ = 14234222044094. Its totient is φ = 14234222044092.
The previous prime is 14234222043953. The next prime is 14234222044117. The reversal of 14234222044093 is 39044022243241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12730317153849 + 1503904890244 = 3567957^2 + 1226338^2 .
It is an emirp because it is prime and its reverse (39044022243241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14234222044093 - 241 = 12035198788541 is a prime.
It is a super-2 number, since 2×142342220440932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14234222044193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7117111022046 + 7117111022047.
It is an arithmetic number, because the mean of its divisors is an integer number (7117111022047).
Almost surely, 214234222044093 is an apocalyptic number.
It is an amenable number.
14234222044093 is a deficient number, since it is larger than the sum of its proper divisors (1).
14234222044093 is an equidigital number, since it uses as much as digits as its factorization.
14234222044093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 331776, while the sum is 40.
The spelling of 14234222044093 in words is "fourteen trillion, two hundred thirty-four billion, two hundred twenty-two million, forty-four thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •