Base | Representation |
---|---|
bin | 10010111010111011001010… |
… | …00110100110111111001000 |
3 | 12110022121001110112111110010 |
4 | 21131131211012212333020 |
5 | 20423142211333141340 |
6 | 224254002355351520 |
7 | 11523003230225652 |
oct | 1135354506467710 |
9 | 173277043474403 |
10 | 41607044427720 |
11 | 122914a2982352 |
12 | 47bb882bb25a0 |
13 | 1a2a6b1a80715 |
14 | a3bb125a96d2 |
15 | 4c2464993b80 |
hex | 25d7651a6fc8 |
41607044427720 has 64 divisors (see below), whose sum is σ = 130248139086720. Its totient is φ = 10612811331584.
The previous prime is 41607044427719. The next prime is 41607044427733. The reversal of 41607044427720 is 2772444070614.
It is a super-2 number, since 2×416070444277202 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 41607044427720.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7537505289 + ... + 7537510808.
It is an arithmetic number, because the mean of its divisors is an integer number (2035127173230).
Almost surely, 241607044427720 is an apocalyptic number.
41607044427720 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41607044427720 is an abundant number, since it is smaller than the sum of its proper divisors (88641094659000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41607044427720 is a wasteful number, since it uses less digits than its factorization.
41607044427720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15075016134 (or 15075016130 counting only the distinct ones).
The product of its (nonzero) digits is 2107392, while the sum is 48.
The spelling of 41607044427720 in words is "forty-one trillion, six hundred seven billion, forty-four million, four hundred twenty-seven thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •