Base | Representation |
---|---|
bin | 100101011001111000… |
… | …011100100000010100 |
3 | 10211200000011021020200 |
4 | 211121320130200110 |
5 | 1124223121042313 |
6 | 30241145300500 |
7 | 2621161050042 |
oct | 453170344024 |
9 | 124600137220 |
10 | 40162674708 |
11 | 1603a867a52 |
12 | 794a494730 |
13 | 3a3099b5a0 |
14 | 1d30035392 |
15 | 10a0e1bb73 |
hex | 959e1c814 |
40162674708 has 72 divisors (see below), whose sum is σ = 109721165736. Its totient is φ = 12313728000.
The previous prime is 40162674703. The next prime is 40162674733. The reversal of 40162674708 is 80747626104.
It can be written as a sum of positive squares in 4 ways, for example, as 187470864 + 39975203844 = 13692^2 + 199938^2 .
It is a super-2 number, since 2×401626747082 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40162674703) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21193 + ... + 284208.
Almost surely, 240162674708 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40162674708, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54860582868).
40162674708 is an abundant number, since it is smaller than the sum of its proper divisors (69558491028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40162674708 is a wasteful number, since it uses less digits than its factorization.
40162674708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305705 (or 305700 counting only the distinct ones).
The product of its (nonzero) digits is 451584, while the sum is 45.
The spelling of 40162674708 in words is "forty billion, one hundred sixty-two million, six hundred seventy-four thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •