Base | Representation |
---|---|
bin | 100110001100101100… |
… | …001111110111101000 |
3 | 10220212102011201211020 |
4 | 212030230033313220 |
5 | 1132444332141430 |
6 | 30501520132440 |
7 | 2651251504311 |
oct | 461454176750 |
9 | 126772151736 |
10 | 41015115240 |
11 | 16437a66160 |
12 | 7b47a67120 |
13 | 3b38482678 |
14 | 1db1331608 |
15 | 1100ba1b10 |
hex | 98cb0fde8 |
41015115240 has 128 divisors (see below), whose sum is σ = 140067532800. Its totient is φ = 9510744320.
The previous prime is 41015115191. The next prime is 41015115257. The reversal of 41015115240 is 4251151014.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 41015115240.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 645120 + ... + 705839.
It is an arithmetic number, because the mean of its divisors is an integer number (1094277600).
Almost surely, 241015115240 is an apocalyptic number.
41015115240 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41015115240 is an abundant number, since it is smaller than the sum of its proper divisors (99052417560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41015115240 is a wasteful number, since it uses less digits than its factorization.
41015115240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1351007 (or 1351003 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 24.
Adding to 41015115240 its reverse (4251151014), we get a palindrome (45266266254).
The spelling of 41015115240 in words is "forty-one billion, fifteen million, one hundred fifteen thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •