Base | Representation |
---|---|
bin | 100101110110001111… |
… | …101010000010111100 |
3 | 10212220011112210101010 |
4 | 211312033222002330 |
5 | 1131211430142112 |
6 | 30400304315220 |
7 | 2636026506420 |
oct | 456617520274 |
9 | 125804483333 |
10 | 40638521532 |
11 | 16264427794 |
12 | 7a61912b10 |
13 | 3aa8447a5b |
14 | 1d77300b80 |
15 | 10ccab363c |
hex | 9763ea0bc |
40638521532 has 48 divisors (see below), whose sum is σ = 111012556032. Its totient is φ = 11327809920.
The previous prime is 40638521527. The next prime is 40638521537. The reversal of 40638521532 is 23512583604.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (40638521527) and next prime (40638521537).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40638521537) 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 15 ways as a sum of consecutive naturals, for example, 5896458 + ... + 5903345.
It is an arithmetic number, because the mean of its divisors is an integer number (2312761584).
Almost surely, 240638521532 is an apocalyptic number.
40638521532 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
40638521532 is an abundant number, since it is smaller than the sum of its proper divisors (70374034500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40638521532 is a wasteful number, since it uses less digits than its factorization.
40638521532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11799858 (or 11799856 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 39.
The spelling of 40638521532 in words is "forty billion, six hundred thirty-eight million, five hundred twenty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •