Base | Representation |
---|---|
bin | 10010011110000010000100… |
… | …01011011000100011110010 |
3 | 12022210200122212022211200110 |
4 | 21033001002023120203302 |
5 | 20310411112141001120 |
6 | 222213543404002150 |
7 | 11361200510462640 |
oct | 1117010213304362 |
9 | 168720585284613 |
10 | 40614321031410 |
11 | 11a39489455515 |
12 | 467b3b1b30356 |
13 | 1987bb61b6649 |
14 | a05a5a722190 |
15 | 4a6711e832e0 |
hex | 24f0422d88f2 |
40614321031410 has 1024 divisors, whose sum is σ = 127032645648384. Its totient is φ = 8098873344000.
The previous prime is 40614321031303. The next prime is 40614321031499. The reversal of 40614321031410 is 1413012341604.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 511 ways as a sum of consecutive naturals, for example, 50958997132 + ... + 50958997928.
It is an arithmetic number, because the mean of its divisors is an integer number (124055318016).
Almost surely, 240614321031410 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40614321031410, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63516322824192).
40614321031410 is an abundant number, since it is smaller than the sum of its proper divisors (86418324616974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40614321031410 is a wasteful number, since it uses less digits than its factorization.
40614321031410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1107.
The product of its (nonzero) digits is 6912, while the sum is 30.
The spelling of 40614321031410 in words is "forty trillion, six hundred fourteen billion, three hundred twenty-one million, thirty-one thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •