Base | Representation |
---|---|
bin | 100110011110100101… |
… | …100001110000101001 |
3 | 10221122100002220102202 |
4 | 212132211201300221 |
5 | 1134103211442101 |
6 | 30551403105545 |
7 | 2661555424133 |
oct | 463645416051 |
9 | 127570086382 |
10 | 41315343401 |
11 | 16581486002 |
12 | 80105122b5 |
13 | 3b85730277 |
14 | 1ddd164053 |
15 | 111c20836b |
hex | 99e961c29 |
41315343401 has 4 divisors (see below), whose sum is σ = 41421552900. Its totient is φ = 41209133904.
The previous prime is 41315343397. The next prime is 41315343413. The reversal of 41315343401 is 10434351314.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13726465600 + 27588877801 = 117160^2 + 166099^2 .
It is a cyclic number.
It is not a de Polignac number, because 41315343401 - 22 = 41315343397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41315343451) 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 in 3 ways as a sum of consecutive naturals, for example, 53104166 + ... + 53104943.
It is an arithmetic number, because the mean of its divisors is an integer number (10355388225).
Almost surely, 241315343401 is an apocalyptic number.
It is an amenable number.
41315343401 is a deficient number, since it is larger than the sum of its proper divisors (106209499).
41315343401 is a wasteful number, since it uses less digits than its factorization.
41315343401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106209498.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 41315343401 its reverse (10434351314), we get a palindrome (51749694715).
The spelling of 41315343401 in words is "forty-one billion, three hundred fifteen million, three hundred forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •