Base | Representation |
---|---|
bin | 10010110011011110010001… |
… | …11011111001000111100000 |
3 | 12102102010012202212011110101 |
4 | 21121233020323321013200 |
5 | 20404443342423132430 |
6 | 223540221423312144 |
7 | 11465340566453416 |
oct | 1131571073710740 |
9 | 172363182764411 |
10 | 41351021302240 |
11 | 121a2962562851 |
12 | 477a13144b654 |
13 | 1a0c4ccbb9b70 |
14 | a2d585c892b6 |
15 | 4ba97cec4dca |
hex | 259bc8ef91e0 |
41351021302240 has 48 divisors (see below), whose sum is σ = 105206540741568. Its totient is φ = 15268069403136.
The previous prime is 41351021302187. The next prime is 41351021302319. The reversal of 41351021302240 is 4220312015314.
It is a junction number, because it is equal to n+sod(n) for n = 41351021302199 and 41351021302208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9940147272 + ... + 9940151431.
It is an arithmetic number, because the mean of its divisors is an integer number (2191802932116).
Almost surely, 241351021302240 is an apocalyptic number.
41351021302240 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41351021302240 is an abundant number, since it is smaller than the sum of its proper divisors (63855519439328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41351021302240 is a wasteful number, since it uses less digits than its factorization.
41351021302240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19880298731 (or 19880298723 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 41351021302240 its reverse (4220312015314), we get a palindrome (45571333317554).
The spelling of 41351021302240 in words is "forty-one trillion, three hundred fifty-one billion, twenty-one million, three hundred two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •