Base | Representation |
---|---|
bin | 100101011000000000… |
… | …000010101011001000 |
3 | 10211120210202200211120 |
4 | 211120000002223020 |
5 | 1124142031032444 |
6 | 30234100555240 |
7 | 2620325551302 |
oct | 453000025310 |
9 | 124523680746 |
10 | 40131111624 |
11 | 16023a6a15a |
12 | 793b9b2b20 |
13 | 3a27299cc6 |
14 | 1d29b7a972 |
15 | 109d284b19 |
hex | 958002ac8 |
40131111624 has 32 divisors (see below), whose sum is σ = 101248224000. Its totient is φ = 13254311232.
The previous prime is 40131111607. The next prime is 40131111679. The reversal of 40131111624 is 42611113104.
It is a happy number.
It is a super-2 number, since 2×401311116242 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 40131111594 and 40131111603.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7667704 + ... + 7672935.
It is an arithmetic number, because the mean of its divisors is an integer number (3164007000).
Almost surely, 240131111624 is an apocalyptic number.
It is an amenable number.
40131111624 is an abundant number, since it is smaller than the sum of its proper divisors (61117112376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40131111624 is a wasteful number, since it uses less digits than its factorization.
40131111624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15340757 (or 15340753 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 40131111624 its reverse (42611113104), we get a palindrome (82742224728).
The spelling of 40131111624 in words is "forty billion, one hundred thirty-one million, one hundred eleven thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •