Base | Representation |
---|---|
bin | 101000011100010011… |
… | …000110100000111111 |
3 | 11011002022202020101122 |
4 | 220130103012200333 |
5 | 1202413124124211 |
6 | 31540544301155 |
7 | 3065045445656 |
oct | 503423064077 |
9 | 134068666348 |
10 | 43424442431 |
11 | 17463a69357 |
12 | 84ba9117bb |
13 | 4130685866 |
14 | 215d2dc19d |
15 | 11e246b6db |
hex | a1c4c683f |
43424442431 has 2 divisors, whose sum is σ = 43424442432. Its totient is φ = 43424442430.
The previous prime is 43424442427. The next prime is 43424442433. The reversal of 43424442431 is 13424442434.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 43424442431 - 22 = 43424442427 is a prime.
It is a super-2 number, since 2×434244424312 (a number of 22 digits) contains 22 as substring.
Together with 43424442433, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 43424442391 and 43424442400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43424442433) 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, 21712221215 + 21712221216.
It is an arithmetic number, because the mean of its divisors is an integer number (21712221216).
Almost surely, 243424442431 is an apocalyptic number.
43424442431 is a deficient number, since it is larger than the sum of its proper divisors (1).
43424442431 is an equidigital number, since it uses as much as digits as its factorization.
43424442431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 147456, while the sum is 35.
Adding to 43424442431 its reverse (13424442434), we get a palindrome (56848884865).
The spelling of 43424442431 in words is "forty-three billion, four hundred twenty-four million, four hundred forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •