Base | Representation |
---|---|
bin | 11001000001100000… |
… | …01011110111110101 |
3 | 1021200021012110012011 |
4 | 30200300023313311 |
5 | 210003201414331 |
6 | 10101025524221 |
7 | 653626360411 |
oct | 144060136765 |
9 | 37607173164 |
10 | 13434404341 |
11 | 5774409906 |
12 | 272b1a3671 |
13 | 136139aba7 |
14 | 916327d41 |
15 | 53965e3b1 |
hex | 320c0bdf5 |
13434404341 has 2 divisors, whose sum is σ = 13434404342. Its totient is φ = 13434404340.
The previous prime is 13434404327. The next prime is 13434404353. The reversal of 13434404341 is 14340443431.
It is a happy number.
13434404341 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., 10133442225 + 3300962116 = 100665^2 + 57454^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13434404341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13434404381) 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, 6717202170 + 6717202171.
It is an arithmetic number, because the mean of its divisors is an integer number (6717202171).
Almost surely, 213434404341 is an apocalyptic number.
It is an amenable number.
13434404341 is a deficient number, since it is larger than the sum of its proper divisors (1).
13434404341 is an equidigital number, since it uses as much as digits as its factorization.
13434404341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 13434404341 its reverse (14340443431), we get a palindrome (27774847772).
The spelling of 13434404341 in words is "thirteen billion, four hundred thirty-four million, four hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •