Base | Representation |
---|---|
bin | 1100111011010111101111… |
… | …0001000100100110101101 |
3 | 1212022212010200120202202011 |
4 | 3032311323301010212231 |
5 | 3330341011022301244 |
6 | 50121513355201221 |
7 | 2664636140034646 |
oct | 316657361044655 |
9 | 55285120522664 |
10 | 14214123243949 |
11 | 45901a3012022 |
12 | 1716961146211 |
13 | 7c15032735b5 |
14 | 371d781486cd |
15 | 199b1e1ec434 |
hex | ced7bc449ad |
14214123243949 has 2 divisors, whose sum is σ = 14214123243950. Its totient is φ = 14214123243948.
The previous prime is 14214123243911. The next prime is 14214123244031. The reversal of 14214123243949 is 94934232141241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14147994549924 + 66128694025 = 3761382^2 + 257155^2 .
It is an emirp because it is prime and its reverse (94934232141241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14214123243949 - 225 = 14214089689517 is a prime.
It is a super-2 number, since 2×142141232439492 (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 (14214123243149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7107061621974 + 7107061621975.
It is an arithmetic number, because the mean of its divisors is an integer number (7107061621975).
Almost surely, 214214123243949 is an apocalyptic number.
It is an amenable number.
14214123243949 is a deficient number, since it is larger than the sum of its proper divisors (1).
14214123243949 is an equidigital number, since it uses as much as digits as its factorization.
14214123243949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1492992, while the sum is 49.
The spelling of 14214123243949 in words is "fourteen trillion, two hundred fourteen billion, one hundred twenty-three million, two hundred forty-three thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •