Base | Representation |
---|---|
bin | 100101011110010001… |
… | …010101001011011000 |
3 | 10211212010201011222112 |
4 | 211132101111023120 |
5 | 1124400443312120 |
6 | 30252335411452 |
7 | 2623043652650 |
oct | 453621251330 |
9 | 124763634875 |
10 | 40236307160 |
11 | 1607838a115 |
12 | 796b083b88 |
13 | 3a4300c59a |
14 | 1d39b21360 |
15 | 10a7613bc5 |
hex | 95e4552d8 |
40236307160 has 64 divisors (see below), whose sum is σ = 103639694400. Its totient is φ = 13771984896.
The previous prime is 40236307151. The next prime is 40236307211. The reversal of 40236307160 is 6170363204.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44876 + ... + 287204.
It is an arithmetic number, because the mean of its divisors is an integer number (1619370225).
Almost surely, 240236307160 is an apocalyptic number.
40236307160 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40236307160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51819847200).
40236307160 is an abundant number, since it is smaller than the sum of its proper divisors (63403387240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40236307160 is a wasteful number, since it uses less digits than its factorization.
40236307160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242940 (or 242936 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 32.
The spelling of 40236307160 in words is "forty billion, two hundred thirty-six million, three hundred seven thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •