Base | Representation |
---|---|
bin | 10010110011001010100010… |
… | …00100110001100011001111 |
3 | 12102101002211222110001121202 |
4 | 21121211101010301203033 |
5 | 20404310140112230111 |
6 | 223531305454020115 |
7 | 11464514104520432 |
oct | 1131452104614317 |
9 | 172332758401552 |
10 | 41340420430031 |
11 | 12199412654638 |
12 | 47780731a763b |
13 | 1a0b500889b08 |
14 | a2cc5bdd3819 |
15 | 4ba55c4c5b3b |
hex | 2599511318cf |
41340420430031 has 2 divisors, whose sum is σ = 41340420430032. Its totient is φ = 41340420430030.
The previous prime is 41340420430009. The next prime is 41340420430073. The reversal of 41340420430031 is 13003402404314.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 41340420430031 - 26 = 41340420429967 is a prime.
It is a super-2 number, since 2×413404204300312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41340420429976 and 41340420430003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41340420430081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20670210215015 + 20670210215016.
It is an arithmetic number, because the mean of its divisors is an integer number (20670210215016).
Almost surely, 241340420430031 is an apocalyptic number.
41340420430031 is a deficient number, since it is larger than the sum of its proper divisors (1).
41340420430031 is an equidigital number, since it uses as much as digits as its factorization.
41340420430031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 41340420430031 its reverse (13003402404314), we get a palindrome (54343822834345).
The spelling of 41340420430031 in words is "forty-one trillion, three hundred forty billion, four hundred twenty million, four hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •