Base | Representation |
---|---|
bin | 11010010011011000… |
… | …11010100110100101 |
3 | 1100110010200110010212 |
4 | 31021230122212211 |
5 | 212410022010312 |
6 | 10253124025205 |
7 | 1006636626146 |
oct | 151154324645 |
9 | 40403613125 |
10 | 14121281957 |
11 | 5a97106162 |
12 | 28a1232205 |
13 | 1440794453 |
14 | 97d647acd |
15 | 579add822 |
hex | 349b1a9a5 |
14121281957 has 2 divisors, whose sum is σ = 14121281958. Its totient is φ = 14121281956.
The previous prime is 14121281887. The next prime is 14121281959. The reversal of 14121281957 is 75918212141.
14121281957 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10296972676 + 3824309281 = 101474^2 + 61841^2 .
It is a cyclic number.
It is not a de Polignac number, because 14121281957 - 210 = 14121280933 is a prime.
Together with 14121281959, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14121281959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7060640978 + 7060640979.
It is an arithmetic number, because the mean of its divisors is an integer number (7060640979).
Almost surely, 214121281957 is an apocalyptic number.
It is an amenable number.
14121281957 is a deficient number, since it is larger than the sum of its proper divisors (1).
14121281957 is an equidigital number, since it uses as much as digits as its factorization.
14121281957 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 40320, while the sum is 41.
The spelling of 14121281957 in words is "fourteen billion, one hundred twenty-one million, two hundred eighty-one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •