Base | Representation |
---|---|
bin | 100101100010111001… |
… | …110111001011010000 |
3 | 10212001112222110211010 |
4 | 211202321313023100 |
5 | 1130030343303130 |
6 | 30304153450520 |
7 | 2625006460230 |
oct | 454271671320 |
9 | 125045873733 |
10 | 40314041040 |
11 | 16108252799 |
12 | 7991110a40 |
13 | 3a56158370 |
14 | 1d46197cc0 |
15 | 10ae36b0b0 |
hex | 962e772d0 |
40314041040 has 160 divisors (see below), whose sum is σ = 153813655296. Its totient is φ = 8505815040.
The previous prime is 40314041003. The next prime is 40314041041. The reversal of 40314041040 is 4014041304.
40314041040 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 40314040998 and 40314041016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40314041041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 901101 + ... + 944780.
Almost surely, 240314041040 is an apocalyptic number.
40314041040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40314041040 is an abundant number, since it is smaller than the sum of its proper divisors (113499614256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40314041040 is a wasteful number, since it uses less digits than its factorization.
40314041040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1845917 (or 1845911 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 40314041040 its reverse (4014041304), we get a palindrome (44328082344).
The spelling of 40314041040 in words is "forty billion, three hundred fourteen million, forty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •