Base | Representation |
---|---|
bin | 101000001011011001… |
… | …111000110000101111 |
3 | 11010100120102022001002 |
4 | 220023121320300233 |
5 | 1201323044232211 |
6 | 31452501310515 |
7 | 3055034343533 |
oct | 501331706057 |
9 | 133316368032 |
10 | 43141008431 |
11 | 17328a7a184 |
12 | 843ba0543b |
13 | 40b6a38131 |
14 | 21337dbbc3 |
15 | 11c763103b |
hex | a0b678c2f |
43141008431 has 2 divisors, whose sum is σ = 43141008432. Its totient is φ = 43141008430.
The previous prime is 43141008419. The next prime is 43141008433. The reversal of 43141008431 is 13480014134.
It is a happy number.
43141008431 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 is a cyclic number.
It is not a de Polignac number, because 43141008431 - 210 = 43141007407 is a prime.
It is a super-5 number, since 5×431410084315 (a number of 54 digits) contains 55555 as substring. Note that it is a super-d number also for d = 4, 2.
Together with 43141008433, 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 = 43141008394 and 43141008403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43141008433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21570504215 + 21570504216.
It is an arithmetic number, because the mean of its divisors is an integer number (21570504216).
Almost surely, 243141008431 is an apocalyptic number.
43141008431 is a deficient number, since it is larger than the sum of its proper divisors (1).
43141008431 is an equidigital number, since it uses as much as digits as its factorization.
43141008431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 29.
The spelling of 43141008431 in words is "forty-three billion, one hundred forty-one million, eight thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •