Base | Representation |
---|---|
bin | 100110011110100100… |
… | …101110100011001001 |
3 | 10221122022201020200212 |
4 | 212132210232203021 |
5 | 1134103133234031 |
6 | 30551354410505 |
7 | 2661553561445 |
oct | 463644564311 |
9 | 127568636625 |
10 | 41315133641 |
11 | 16581352451 |
12 | 8010430a35 |
13 | 3b85688952 |
14 | 1ddd10b825 |
15 | 111c1b612b |
hex | 99e92e8c9 |
41315133641 has 8 divisors (see below), whose sum is σ = 41417508000. Its totient is φ = 41212838592.
The previous prime is 41315133637. The next prime is 41315133751. The reversal of 41315133641 is 14633151314.
41315133641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 41315133641 - 22 = 41315133637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41315133598 and 41315133607.
It is not an unprimeable number, because it can be changed into a prime (41315133631) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1100801 + ... + 1137713.
It is an arithmetic number, because the mean of its divisors is an integer number (5177188500).
Almost surely, 241315133641 is an apocalyptic number.
It is an amenable number.
41315133641 is a deficient number, since it is larger than the sum of its proper divisors (102374359).
41315133641 is a wasteful number, since it uses less digits than its factorization.
41315133641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39655.
The product of its digits is 12960, while the sum is 32.
Adding to 41315133641 its reverse (14633151314), we get a palindrome (55948284955).
The spelling of 41315133641 in words is "forty-one billion, three hundred fifteen million, one hundred thirty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •