Base | Representation |
---|---|
bin | 100110011010011110… |
… | …000000111010101000 |
3 | 10221110112010100200110 |
4 | 212122132000322220 |
5 | 1133433020440000 |
6 | 30540454334320 |
7 | 2660056316313 |
oct | 463236007250 |
9 | 127415110613 |
10 | 41246265000 |
11 | 16546494416 |
12 | 7bb135a3a0 |
13 | 3b74325085 |
14 | 1dd3d0197a |
15 | 1116110850 |
hex | 99a780ea8 |
41246265000 has 160 divisors (see below), whose sum is σ = 133297956000. Its totient is φ = 10619616000.
The previous prime is 41246264993. The next prime is 41246265001. The reversal of 41246265000 is 56264214.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (41246265001) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 387591 + ... + 482409.
It is an arithmetic number, because the mean of its divisors is an integer number (833112225).
Almost surely, 241246265000 is an apocalyptic number.
41246265000 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 41246265000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66648978000).
41246265000 is an abundant number, since it is smaller than the sum of its proper divisors (92051691000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41246265000 is a wasteful number, since it uses less digits than its factorization.
41246265000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94877 (or 94858 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
The spelling of 41246265000 in words is "forty-one billion, two hundred forty-six million, two hundred sixty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •