Base | Representation |
---|---|
bin | 100110110000111010… |
… | …100100101000100000 |
3 | 10222102202201212022000 |
4 | 212300322210220200 |
5 | 1140220422200310 |
6 | 31042110044000 |
7 | 3002311250100 |
oct | 466072445040 |
9 | 128382655260 |
10 | 41622850080 |
11 | 1671a017359 |
12 | 80974a9600 |
13 | 3c04358a96 |
14 | 202bd2d200 |
15 | 11391eb4c0 |
hex | 9b0ea4a20 |
41622850080 has 1152 divisors, whose sum is σ = 182020608000. Its totient is φ = 8831047680.
The previous prime is 41622850037. The next prime is 41622850081. The reversal of 41622850080 is 8005822614.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (41622850081) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 317731615 + ... + 317731745.
It is an arithmetic number, because the mean of its divisors is an integer number (158004000).
Almost surely, 241622850080 is an apocalyptic number.
41622850080 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41622850080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91010304000).
41622850080 is an abundant number, since it is smaller than the sum of its proper divisors (140397757920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41622850080 is a wasteful number, since it uses less digits than its factorization.
41622850080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267 (or 246 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 36.
The spelling of 41622850080 in words is "forty-one billion, six hundred twenty-two million, eight hundred fifty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •