Base | Representation |
---|---|
bin | 10010010011100100001001… |
… | …10000010010110001101000 |
3 | 12021112022022112001112002102 |
4 | 21021302010300102301220 |
5 | 20234013021123003230 |
6 | 221340422535552532 |
7 | 11323206006520133 |
oct | 1111620460226150 |
9 | 167468275045072 |
10 | 40254660750440 |
11 | 1190a9a6614094 |
12 | 462175852b748 |
13 | 195ccc9124346 |
14 | 9d249bcbd21a |
15 | 49c1b1cc9045 |
hex | 249c84c12c68 |
40254660750440 has 32 divisors (see below), whose sum is σ = 90574213716000. Its totient is φ = 16101646161984.
The previous prime is 40254660750413. The next prime is 40254660750443. The reversal of 40254660750440 is 4405706645204.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (40254660750443) 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 7 ways as a sum of consecutive naturals, for example, 3810950 + ... + 9748469.
It is an arithmetic number, because the mean of its divisors is an integer number (2830444178625).
Almost surely, 240254660750440 is an apocalyptic number.
40254660750440 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40254660750440 is an abundant number, since it is smaller than the sum of its proper divisors (50319552965560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40254660750440 is a wasteful number, since it uses less digits than its factorization.
40254660750440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13633649 (or 13633645 counting only the distinct ones).
The product of its (nonzero) digits is 3225600, while the sum is 47.
The spelling of 40254660750440 in words is "forty trillion, two hundred fifty-four billion, six hundred sixty million, seven hundred fifty thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •