Base | Representation |
---|---|
bin | 100101011001001110… |
… | …010011000110011100 |
3 | 10211122020100221110110 |
4 | 211121032103012130 |
5 | 1124212304014030 |
6 | 30240112410020 |
7 | 2620665122343 |
oct | 453116230634 |
9 | 124566327413 |
10 | 40151626140 |
11 | 16034600aaa |
12 | 7946846910 |
13 | 3a2b600682 |
14 | 1d2c79ab5a |
15 | 109ee881b0 |
hex | 95939319c |
40151626140 has 48 divisors (see below), whose sum is σ = 112852067328. Its totient is φ = 10666384704.
The previous prime is 40151626129. The next prime is 40151626147. The reversal of 40151626140 is 4162615104.
It is a super-2 number, since 2×401516261402 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 40151626098 and 40151626107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40151626147) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1256452 + ... + 1288011.
It is an arithmetic number, because the mean of its divisors is an integer number (2351084736).
Almost surely, 240151626140 is an apocalyptic number.
It is an amenable number.
40151626140 is an abundant number, since it is smaller than the sum of its proper divisors (72700441188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40151626140 is a wasteful number, since it uses less digits than its factorization.
40151626140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2544738 (or 2544736 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The spelling of 40151626140 in words is "forty billion, one hundred fifty-one million, six hundred twenty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.240 sec. • engine limits •