Base | Representation |
---|---|
bin | 101010101011100… |
… | …1100010111101101 |
3 | 10200210211102022222 |
4 | 1111113030113231 |
5 | 10413112041331 |
6 | 354035445125 |
7 | 50330006006 |
oct | 12527142755 |
9 | 3623742288 |
10 | 1432143341 |
11 | 675453542 |
12 | 33b7567a5 |
13 | 19a9241c5 |
14 | d82bc1ad |
15 | 85ae3b7b |
hex | 555cc5ed |
1432143341 has 2 divisors, whose sum is σ = 1432143342. Its totient is φ = 1432143340.
The previous prime is 1432143289. The next prime is 1432143347. The reversal of 1432143341 is 1433412341.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1057875625 + 374267716 = 32525^2 + 19346^2 .
It is a cyclic number.
It is not a de Polignac number, because 1432143341 - 210 = 1432142317 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1432143341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1432143347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 716071670 + 716071671.
It is an arithmetic number, because the mean of its divisors is an integer number (716071671).
Almost surely, 21432143341 is an apocalyptic number.
It is an amenable number.
1432143341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1432143341 is an equidigital number, since it uses as much as digits as its factorization.
1432143341 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3456, while the sum is 26.
The square root of 1432143341 is about 37843.6697612692. The cubic root of 1432143341 is about 1127.1857662537.
Adding to 1432143341 its reverse (1433412341), we get a palindrome (2865555682).
The spelling of 1432143341 in words is "one billion, four hundred thirty-two million, one hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •