Base | Representation |
---|---|
bin | 11001000001001110… |
… | …00001001110100001 |
3 | 1021200002200101000212 |
4 | 30200213001032201 |
5 | 210002043021231 |
6 | 10100502223505 |
7 | 653600062025 |
oct | 144047011641 |
9 | 37602611025 |
10 | 13432001441 |
11 | 5773018541 |
12 | 272a424b95 |
13 | 1360a39261 |
14 | 915ca0385 |
15 | 53933742b |
hex | 3209c13a1 |
13432001441 has 2 divisors, whose sum is σ = 13432001442. Its totient is φ = 13432001440.
The previous prime is 13432001399. The next prime is 13432001459. The reversal of 13432001441 is 14410023431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12495886225 + 936115216 = 111785^2 + 30596^2 .
It is an emirp because it is prime and its reverse (14410023431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13432001441 is a prime.
It is a super-2 number, since 2×134320014412 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13432001741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6716000720 + 6716000721.
It is an arithmetic number, because the mean of its divisors is an integer number (6716000721).
Almost surely, 213432001441 is an apocalyptic number.
It is an amenable number.
13432001441 is a deficient number, since it is larger than the sum of its proper divisors (1).
13432001441 is an equidigital number, since it uses as much as digits as its factorization.
13432001441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 13432001441 its reverse (14410023431), we get a palindrome (27842024872).
The spelling of 13432001441 in words is "thirteen billion, four hundred thirty-two million, one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •