Base | Representation |
---|---|
bin | 100101011111000000… |
… | …111110000000000000 |
3 | 10211220000012122021011 |
4 | 211133000332000000 |
5 | 1124412142421021 |
6 | 30253503210304 |
7 | 2623255054024 |
oct | 453700760000 |
9 | 124800178234 |
10 | 40248795136 |
11 | 16084439560 |
12 | 79732a6994 |
13 | 3a45792714 |
14 | 1d3b652384 |
15 | 10a877dde1 |
hex | 95f03e000 |
40248795136 has 112 divisors (see below), whose sum is σ = 88149714480. Its totient is φ = 18224250880.
The previous prime is 40248795107. The next prime is 40248795143. The reversal of 40248795136 is 63159784204.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 40248795136.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28564800 + ... + 28566208.
It is a 1-persistent number, because it is pandigital, but 2⋅40248795136 = 80497590272 is not.
Almost surely, 240248795136 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 40248795136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44074857240).
40248795136 is an abundant number, since it is smaller than the sum of its proper divisors (47900919344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40248795136 is a wasteful number, since it uses less digits than its factorization.
40248795136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1763 (or 1739 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 49.
The spelling of 40248795136 in words is "forty billion, two hundred forty-eight million, seven hundred ninety-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •