Base | Representation |
---|---|
bin | 100101101111110110… |
… | …000100010101000111 |
3 | 10212121200111202112022 |
4 | 211233312010111013 |
5 | 1131001433301101 |
6 | 30341511113355 |
7 | 2633254043342 |
oct | 455766042507 |
9 | 125550452468 |
10 | 40531150151 |
11 | 16209861008 |
12 | 7a3197285b |
13 | 3a8c122cab |
14 | 1d66d51459 |
15 | 10c3454a1b |
hex | 96fd84547 |
40531150151 has 8 divisors (see below), whose sum is σ = 45174037680. Its totient is φ = 36139229568.
The previous prime is 40531150139. The next prime is 40531150157. The reversal of 40531150151 is 15105113504.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40531150151 - 214 = 40531133767 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40531150151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40531150157) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 62741396 + ... + 62742041.
It is an arithmetic number, because the mean of its divisors is an integer number (5646754710).
Almost surely, 240531150151 is an apocalyptic number.
40531150151 is a deficient number, since it is larger than the sum of its proper divisors (4642887529).
40531150151 is a wasteful number, since it uses less digits than its factorization.
40531150151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125483473.
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 40531150151 its reverse (15105113504), we get a palindrome (55636263655).
The spelling of 40531150151 in words is "forty billion, five hundred thirty-one million, one hundred fifty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •