Base | Representation |
---|---|
bin | 1100000001110011000… |
… | …10111001111000000000 |
3 | 1110111202100120201021110 |
4 | 12000321202321320000 |
5 | 23232400232433210 |
6 | 513505334123320 |
7 | 41600343454530 |
oct | 6007142717000 |
9 | 1414670521243 |
10 | 413282311680 |
11 | 14a2aa0aa797 |
12 | 6811b4b0540 |
13 | 2cc84356974 |
14 | 160082194c0 |
15 | ab3ca13420 |
hex | 60398b9e00 |
413282311680 has 640 divisors, whose sum is σ = 1594985914368. Its totient is φ = 89246564352.
The previous prime is 413282311667. The next prime is 413282311727. The reversal of 413282311680 is 86113282314.
It is a tau number, because it is divible by the number of its divisors (640).
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, 102625827 + ... + 102629853.
Almost surely, 2413282311680 is an apocalyptic number.
413282311680 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 413282311680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (797492957184).
413282311680 is an abundant number, since it is smaller than the sum of its proper divisors (1181703602688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413282311680 is a wasteful number, since it uses less digits than its factorization.
413282311680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4166 (or 4150 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 39.
Adding to 413282311680 its reverse (86113282314), we get a palindrome (499395593994).
The spelling of 413282311680 in words is "four hundred thirteen billion, two hundred eighty-two million, three hundred eleven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •