Base | Representation |
---|---|
bin | 1100000001111100111… |
… | …00010110000011100100 |
3 | 1110111222002012012112011 |
4 | 12000332130112003210 |
5 | 23233032301300210 |
6 | 513521431204004 |
7 | 41602362043153 |
oct | 6007634260344 |
9 | 1414862165464 |
10 | 413364478180 |
11 | 14a341520695 |
12 | 68142b16604 |
13 | 2cc983951b4 |
14 | 160150c759a |
15 | ab44d43d8a |
hex | 603e7160e4 |
413364478180 has 96 divisors (see below), whose sum is σ = 923028462720. Its totient is φ = 154960619520.
The previous prime is 413364478147. The next prime is 413364478229. The reversal of 413364478180 is 81874463314.
It is a super-2 number, since 2×4133644781802 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 91389399 + ... + 91393921.
It is an arithmetic number, because the mean of its divisors is an integer number (9614879820).
Almost surely, 2413364478180 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 413364478180, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (461514231360).
413364478180 is an abundant number, since it is smaller than the sum of its proper divisors (509663984540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413364478180 is a wasteful number, since it uses less digits than its factorization.
413364478180 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5629 (or 5627 counting only the distinct ones).
The product of its (nonzero) digits is 1548288, while the sum is 49.
The spelling of 413364478180 in words is "four hundred thirteen billion, three hundred sixty-four million, four hundred seventy-eight thousand, one hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •