Base | Representation |
---|---|
bin | 100110001011111011… |
… | …110100111011110000 |
3 | 10220211112021211222020 |
4 | 212023323310323300 |
5 | 1132433110001000 |
6 | 30500344111440 |
7 | 2651035556631 |
oct | 461373647360 |
9 | 126745254866 |
10 | 41002422000 |
11 | 16430886581 |
12 | 7b43765580 |
13 | 3b35959c87 |
14 | 1dad789888 |
15 | 10ee9e5ba0 |
hex | 98bef4ef0 |
41002422000 has 320 divisors, whose sum is σ = 139722485760. Its totient is φ = 10323456000.
The previous prime is 41002421969. The next prime is 41002422011. The reversal of 41002422000 is 22420014.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10900120 + ... + 10903880.
It is an arithmetic number, because the mean of its divisors is an integer number (436632768).
Almost surely, 241002422000 is an apocalyptic number.
41002422000 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 41002422000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69861242880).
41002422000 is an abundant number, since it is smaller than the sum of its proper divisors (98720063760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41002422000 is a wasteful number, since it uses less digits than its factorization.
41002422000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3889 (or 3873 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 41002422000 its reverse (22420014), we get a palindrome (41024842014).
The spelling of 41002422000 in words is "forty-one billion, two million, four hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •