Base | Representation |
---|---|
bin | 100110100011111000… |
… | …111000101100000011 |
3 | 10221212112111120121121 |
4 | 212203320320230003 |
5 | 1134244000213011 |
6 | 31004301533111 |
7 | 2664015530641 |
oct | 464370705403 |
9 | 127775446547 |
10 | 41404304131 |
11 | 16617717573 |
12 | 8036274197 |
13 | 3b9acaa158 |
14 | 200acc0191 |
15 | 1124e2be71 |
hex | 9a3e38b03 |
41404304131 has 2 divisors, whose sum is σ = 41404304132. Its totient is φ = 41404304130.
The previous prime is 41404304113. The next prime is 41404304143. The reversal of 41404304131 is 13140340414.
Together with previous prime (41404304113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 41404304131 - 27 = 41404304003 is a prime.
It is a super-2 number, since 2×414043041312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41404304096 and 41404304105.
It is not a weakly prime, because it can be changed into another prime (41404304111) 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, 20702152065 + 20702152066.
It is an arithmetic number, because the mean of its divisors is an integer number (20702152066).
Almost surely, 241404304131 is an apocalyptic number.
41404304131 is a deficient number, since it is larger than the sum of its proper divisors (1).
41404304131 is an equidigital number, since it uses as much as digits as its factorization.
41404304131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 41404304131 its reverse (13140340414), we get a palindrome (54544644545).
The spelling of 41404304131 in words is "forty-one billion, four hundred four million, three hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •