Base | Representation |
---|---|
bin | 10010011110000101010001… |
… | …10101110010100110011000 |
3 | 12022210212002220022110100020 |
4 | 21033002220311302212120 |
5 | 20310423124104033102 |
6 | 222214430332510440 |
7 | 11361261263541060 |
oct | 1117025065624630 |
9 | 168725086273306 |
10 | 40616043424152 |
11 | 11a3a192722699 |
12 | 467b7b291b420 |
13 | 19880cbca3451 |
14 | a05b813963a0 |
15 | 4a67b32abbbc |
hex | 24f0a8d72998 |
40616043424152 has 64 divisors (see below), whose sum is σ = 122153514067200. Its totient is φ = 10993816264320.
The previous prime is 40616043424127. The next prime is 40616043424193. The reversal of 40616043424152 is 25142434061604.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6362158999 + ... + 6362165382.
It is an arithmetic number, because the mean of its divisors is an integer number (1908648657300).
Almost surely, 240616043424152 is an apocalyptic number.
40616043424152 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
40616043424152 is an abundant number, since it is smaller than the sum of its proper divisors (81537470643048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40616043424152 is a wasteful number, since it uses less digits than its factorization.
40616043424152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12724324416 (or 12724324412 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 42.
Adding to 40616043424152 its reverse (25142434061604), we get a palindrome (65758477485756).
The spelling of 40616043424152 in words is "forty trillion, six hundred sixteen billion, forty-three million, four hundred twenty-four thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •