Base | Representation |
---|---|
bin | 100110011110100000… |
… | …111100100101110101 |
3 | 10221122020211220012221 |
4 | 212132200330211311 |
5 | 1134102410030311 |
6 | 30551321242341 |
7 | 2661542263165 |
oct | 463640744565 |
9 | 127566756187 |
10 | 41314142581 |
11 | 16580835898 |
12 | 80100333b1 |
13 | 3b853cc81a |
14 | 1ddcd305a5 |
15 | 111c06c671 |
hex | 99e83c975 |
41314142581 has 2 divisors, whose sum is σ = 41314142582. Its totient is φ = 41314142580.
The previous prime is 41314142497. The next prime is 41314142591. The reversal of 41314142581 is 18524141314.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39416146225 + 1897996356 = 198535^2 + 43566^2 .
It is a cyclic number.
It is not a de Polignac number, because 41314142581 - 29 = 41314142069 is a prime.
It is a super-3 number, since 3×413141425813 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41314142591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20657071290 + 20657071291.
It is an arithmetic number, because the mean of its divisors is an integer number (20657071291).
Almost surely, 241314142581 is an apocalyptic number.
It is an amenable number.
41314142581 is a deficient number, since it is larger than the sum of its proper divisors (1).
41314142581 is an equidigital number, since it uses as much as digits as its factorization.
41314142581 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15360, while the sum is 34.
Adding to 41314142581 its reverse (18524141314), we get a palindrome (59838283895).
The spelling of 41314142581 in words is "forty-one billion, three hundred fourteen million, one hundred forty-two thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •