Base | Representation |
---|---|
bin | 100110011111001011… |
… | …100101110100011101 |
3 | 10221200000212211211000 |
4 | 212133023211310131 |
5 | 1134113240242001 |
6 | 30552401020513 |
7 | 2662036302612 |
oct | 463713456435 |
9 | 127600784730 |
10 | 41325321501 |
11 | 16587080772 |
12 | 8013924739 |
13 | 3b87814b79 |
14 | 2000600509 |
15 | 111d029a86 |
hex | 99f2e5d1d |
41325321501 has 16 divisors (see below), whose sum is σ = 61348432000. Its totient is φ = 27493634304.
The previous prime is 41325321467. The next prime is 41325321509. The reversal of 41325321501 is 10512352314.
41325321501 is a `hidden beast` number, since 4 + 132 + 5 + 3 + 21 + 501 = 666.
It is not a de Polignac number, because 41325321501 - 215 = 41325288733 is a prime.
It is a super-2 number, since 2×413253215012 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41325321509) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1558276 + ... + 1584573.
It is an arithmetic number, because the mean of its divisors is an integer number (3834277000).
Almost surely, 241325321501 is an apocalyptic number.
It is an amenable number.
41325321501 is a deficient number, since it is larger than the sum of its proper divisors (20023110499).
41325321501 is a wasteful number, since it uses less digits than its factorization.
41325321501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3143345 (or 3143339 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 41325321501 its reverse (10512352314), we get a palindrome (51837673815).
The spelling of 41325321501 in words is "forty-one billion, three hundred twenty-five million, three hundred twenty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •