Base | Representation |
---|---|
bin | 100110100100110000… |
… | …111100110100100000 |
3 | 10221220120011021002112 |
4 | 212210300330310200 |
5 | 1134311231013440 |
6 | 31005544534452 |
7 | 2664254462210 |
oct | 464460746440 |
9 | 127816137075 |
10 | 41419001120 |
11 | 16624a45642 |
12 | 803b181428 |
13 | 3ba10548b3 |
14 | 200cc28240 |
15 | 1126381965 |
hex | 9a4c3cd20 |
41419001120 has 192 divisors, whose sum is σ = 113506396416. Its totient is φ = 13989580800.
The previous prime is 41419001089. The next prime is 41419001147. The reversal of 41419001120 is 2110091414.
It is a super-2 number, since 2×414190011202 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25677434 + ... + 25679046.
It is an arithmetic number, because the mean of its divisors is an integer number (591179148).
Almost surely, 241419001120 is an apocalyptic number.
41419001120 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 41419001120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56753198208).
41419001120 is an abundant number, since it is smaller than the sum of its proper divisors (72087395296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41419001120 is a wasteful number, since it uses less digits than its factorization.
41419001120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1963 (or 1955 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 41419001120 its reverse (2110091414), we get a palindrome (43529092534).
The spelling of 41419001120 in words is "forty-one billion, four hundred nineteen million, one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •