Base | Representation |
---|---|
bin | 100101101111101111… |
… | …000000111110100000 |
3 | 10212121120000211112100 |
4 | 211233233000332200 |
5 | 1131001000121113 |
6 | 30341403330400 |
7 | 2633232243411 |
oct | 455757007640 |
9 | 125546024470 |
10 | 40529301408 |
11 | 16208809022 |
12 | 7a31220a00 |
13 | 3a8b92666b |
14 | 1d669cd808 |
15 | 10c31dbd73 |
hex | 96fbc0fa0 |
40529301408 has 72 divisors (see below), whose sum is σ = 117208728000. Its totient is φ = 13280782464.
The previous prime is 40529301403. The next prime is 40529301433. The reversal of 40529301408 is 80410392504.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (40529301403) 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 11 ways as a sum of consecutive naturals, for example, 1175608 + ... + 1209591.
It is an arithmetic number, because the mean of its divisors is an integer number (1627899000).
Almost surely, 240529301408 is an apocalyptic number.
40529301408 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
40529301408 is an abundant number, since it is smaller than the sum of its proper divisors (76679426592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40529301408 is a wasteful number, since it uses less digits than its factorization.
40529301408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2385274 (or 2385263 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The spelling of 40529301408 in words is "forty billion, five hundred twenty-nine million, three hundred one thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •