Base | Representation |
---|---|
bin | 100110101111100101… |
… | …001001010110010000 |
3 | 10222101012121010111121 |
4 | 212233211021112100 |
5 | 1140144204043310 |
6 | 31035550052024 |
7 | 3001620020341 |
oct | 465745112620 |
9 | 128335533447 |
10 | 41600456080 |
11 | 16708411417 |
12 | 808baaa014 |
13 | 3bcc817ab1 |
14 | 2028d800c8 |
15 | 11372760da |
hex | 9af949590 |
41600456080 has 20 divisors (see below), whose sum is σ = 96721060572. Its totient is φ = 16640182400.
The previous prime is 41600456021. The next prime is 41600456083. The reversal of 41600456080 is 8065400614.
It can be written as a sum of positive squares in 2 ways, for example, as 22925593744 + 18674862336 = 151412^2 + 136656^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is not an unprimeable number, because it can be changed into a prime (41600456083) 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, 260002771 + ... + 260002930.
Almost surely, 241600456080 is an apocalyptic number.
41600456080 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41600456080 is an abundant number, since it is smaller than the sum of its proper divisors (55120604492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41600456080 is a wasteful number, since it uses less digits than its factorization.
41600456080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 520005714 (or 520005708 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 41600456080 its reverse (8065400614), we get a palindrome (49665856694).
The spelling of 41600456080 in words is "forty-one billion, six hundred million, four hundred fifty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •