Base | Representation |
---|---|
bin | 11000101011110001… |
… | …11010010101010001 |
3 | 1021012120020120211112 |
4 | 30111320322111101 |
5 | 204120022024132 |
6 | 10030555223105 |
7 | 646254231503 |
oct | 142570722521 |
9 | 37176216745 |
10 | 13252142417 |
11 | 5690541818 |
12 | 269a147a95 |
13 | 13326b45b7 |
14 | 8da041d73 |
15 | 52865aab2 |
hex | 315e3a551 |
13252142417 has 2 divisors, whose sum is σ = 13252142418. Its totient is φ = 13252142416.
The previous prime is 13252142411. The next prime is 13252142429. The reversal of 13252142417 is 71424125231.
It is a happy number.
13252142417 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12805411921 + 446730496 = 113161^2 + 21136^2 .
It is a cyclic number.
It is not a de Polignac number, because 13252142417 - 214 = 13252126033 is a prime.
It is not a weakly prime, because it can be changed into another prime (13252142411) 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, 6626071208 + 6626071209.
It is an arithmetic number, because the mean of its divisors is an integer number (6626071209).
Almost surely, 213252142417 is an apocalyptic number.
It is an amenable number.
13252142417 is a deficient number, since it is larger than the sum of its proper divisors (1).
13252142417 is an equidigital number, since it uses as much as digits as its factorization.
13252142417 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13440, while the sum is 32.
Adding to 13252142417 its reverse (71424125231), we get a palindrome (84676267648).
The spelling of 13252142417 in words is "thirteen billion, two hundred fifty-two million, one hundred forty-two thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •