Base | Representation |
---|---|
bin | 100110011110100110… |
… | …010101101101000000 |
3 | 10221122100111201021201 |
4 | 212132212111231000 |
5 | 1134103240244120 |
6 | 30551411430544 |
7 | 2661560301334 |
oct | 463646255500 |
9 | 127570451251 |
10 | 41315556160 |
11 | 1658161093a |
12 | 80105b5454 |
13 | 3b857a6068 |
14 | 1ddd1bb7c4 |
15 | 111c24b40a |
hex | 99e995b40 |
41315556160 has 28 divisors (see below), whose sum is σ = 98382668868. Its totient is φ = 16526222336.
The previous prime is 41315556133. The next prime is 41315556197. The reversal of 41315556160 is 6165551314.
It can be written as a sum of positive squares in 2 ways, for example, as 20120855104 + 21194701056 = 141848^2 + 145584^2 .
It is a super-2 number, since 2×413155561602 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
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, 64555237 + ... + 64555876.
Almost surely, 241315556160 is an apocalyptic number.
41315556160 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41315556160 is an abundant number, since it is smaller than the sum of its proper divisors (57067112708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41315556160 is a wasteful number, since it uses less digits than its factorization.
41315556160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129111130 (or 129111120 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 41315556160 in words is "forty-one billion, three hundred fifteen million, five hundred fifty-six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •