Base | Representation |
---|---|
bin | 11010101111001000… |
… | …10101100110011101 |
3 | 1101001100200001110221 |
4 | 31113210111212131 |
5 | 213344113422331 |
6 | 10332201001341 |
7 | 1015464241456 |
oct | 152744254635 |
9 | 41040601427 |
10 | 14354045341 |
11 | 60a6536799 |
12 | 2947183251 |
13 | 1479a8046c |
14 | 9a251812d |
15 | 59026a711 |
hex | 35791599d |
14354045341 has 2 divisors, whose sum is σ = 14354045342. Its totient is φ = 14354045340.
The previous prime is 14354045323. The next prime is 14354045357.
14354045341 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14299137241 + 54908100 = 119579^2 + 7410^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 14354045341 - 25 = 14354045309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14354045297 and 14354045306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14354040341) 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, 7177022670 + 7177022671.
It is an arithmetic number, because the mean of its divisors is an integer number (7177022671).
Almost surely, 214354045341 is an apocalyptic number.
It is an amenable number.
14354045341 is a deficient number, since it is larger than the sum of its proper divisors (1).
14354045341 is an equidigital number, since it uses as much as digits as its factorization.
14354045341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 34.
It can be divided in two parts, 143540 and 45341, that added together give a palindrome (188881).
The spelling of 14354045341 in words is "fourteen billion, three hundred fifty-four million, forty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •