Base | Representation |
---|---|
bin | 100101101111011111… |
… | …011101100001011110 |
3 | 10212121021100200102100 |
4 | 211233133131201132 |
5 | 1130443424132110 |
6 | 30341140105530 |
7 | 2633152502124 |
oct | 455737354136 |
9 | 125537320370 |
10 | 40525224030 |
11 | 16206483695 |
12 | 7a2b9952a6 |
13 | 3a8ab29805 |
14 | 1d6624b914 |
15 | 10c2b83bc0 |
hex | 96f7dd85e |
40525224030 has 48 divisors (see below), whose sum is σ = 106938219024. Its totient is φ = 10645430400.
The previous prime is 40525224029. The next prime is 40525224037. The reversal of 40525224030 is 3042252504.
It is a happy number.
40525224030 is a `hidden beast` number, since 4 + 0 + 5 + 252 + 2 + 403 + 0 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 40525223985 and 40525224003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40525224037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3354271 + ... + 3366330.
It is an arithmetic number, because the mean of its divisors is an integer number (2227879563).
Almost surely, 240525224030 is an apocalyptic number.
40525224030 is an abundant number, since it is smaller than the sum of its proper divisors (66412994994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40525224030 is a wasteful number, since it uses less digits than its factorization.
40525224030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6720681 (or 6720678 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 27.
Adding to 40525224030 its reverse (3042252504), we get a palindrome (43567476534).
The spelling of 40525224030 in words is "forty billion, five hundred twenty-five million, two hundred twenty-four thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •