Base | Representation |
---|---|
bin | 100101110100011000… |
… | …011101101011110100 |
3 | 10212210222202100020110 |
4 | 211310120131223310 |
5 | 1131130430311024 |
6 | 30353230503020 |
7 | 2635200102036 |
oct | 456430355364 |
9 | 125728670213 |
10 | 40607275764 |
11 | 16248826340 |
12 | 7a53364a70 |
13 | 3aa1b27a33 |
14 | 1d730c9c56 |
15 | 10c9e90629 |
hex | 97461daf4 |
40607275764 has 24 divisors (see below), whose sum is σ = 103363975008. Its totient is φ = 12305235040.
The previous prime is 40607275763. The next prime is 40607275769. The reversal of 40607275764 is 46757270604.
It is a happy number.
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40607275763) 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, 153815307 + ... + 153815570.
It is an arithmetic number, because the mean of its divisors is an integer number (4306832292).
Almost surely, 240607275764 is an apocalyptic number.
40607275764 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
40607275764 is an abundant number, since it is smaller than the sum of its proper divisors (62756699244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40607275764 is a wasteful number, since it uses less digits than its factorization.
40607275764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307630895 (or 307630893 counting only the distinct ones).
The product of its (nonzero) digits is 1975680, while the sum is 48.
The spelling of 40607275764 in words is "forty billion, six hundred seven million, two hundred seventy-five thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •