Base | Representation |
---|---|
bin | 100110011110100001… |
… | …101000011101101001 |
3 | 10221122021012000201111 |
4 | 212132201220131221 |
5 | 1134102431303111 |
6 | 30551325150321 |
7 | 2661543642121 |
oct | 463641503551 |
9 | 127567160644 |
10 | 41314322281 |
11 | 16580948901 |
12 | 80100bb3a1 |
13 | 3b8546355b |
14 | 1ddcd79c81 |
15 | 111c0a5a21 |
hex | 99e868769 |
41314322281 has 2 divisors, whose sum is σ = 41314322282. Its totient is φ = 41314322280.
The previous prime is 41314322261. The next prime is 41314322339. The reversal of 41314322281 is 18222341314.
It is a happy number.
41314322281 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21450238681 + 19864083600 = 146459^2 + 140940^2 .
It is a cyclic number.
It is not a de Polignac number, because 41314322281 - 213 = 41314314089 is a prime.
It is a super-2 number, since 2×413143222812 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (41314322261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20657161140 + 20657161141.
It is an arithmetic number, because the mean of its divisors is an integer number (20657161141).
Almost surely, 241314322281 is an apocalyptic number.
It is an amenable number.
41314322281 is a deficient number, since it is larger than the sum of its proper divisors (1).
41314322281 is an equidigital number, since it uses as much as digits as its factorization.
41314322281 is an evil number, because the sum of its binary digits is even.
The product of its digits is 9216, while the sum is 31.
Adding to 41314322281 its reverse (18222341314), we get a palindrome (59536663595).
The spelling of 41314322281 in words is "forty-one billion, three hundred fourteen million, three hundred twenty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •