Base | Representation |
---|---|
bin | 100110101010011001… |
… | …001100000000000101 |
3 | 10222011010212000012212 |
4 | 212222121030000011 |
5 | 1140004414411031 |
6 | 31023200553205 |
7 | 2666512243103 |
oct | 465231140005 |
9 | 128133760185 |
10 | 41513435141 |
11 | 16673285292 |
12 | 8066922805 |
13 | 3bb7799b09 |
14 | 201b5aac73 |
15 | 112e7d712b |
hex | 9aa64c005 |
41513435141 has 8 divisors (see below), whose sum is σ = 46268844480. Its totient is φ = 37015075008.
The previous prime is 41513435101. The next prime is 41513435177. The reversal of 41513435141 is 14153431514.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 41513435141 - 210 = 41513434117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41513435098 and 41513435107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41513435101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64261961 + ... + 64262606.
It is an arithmetic number, because the mean of its divisors is an integer number (5783605560).
Almost surely, 241513435141 is an apocalyptic number.
It is an amenable number.
41513435141 is a deficient number, since it is larger than the sum of its proper divisors (4755409339).
41513435141 is a wasteful number, since it uses less digits than its factorization.
41513435141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128524603.
The product of its digits is 14400, while the sum is 32.
Adding to 41513435141 its reverse (14153431514), we get a palindrome (55666866655).
The spelling of 41513435141 in words is "forty-one billion, five hundred thirteen million, four hundred thirty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •