Base | Representation |
---|---|
bin | 100101010000010000… |
… | …001000111111111000 |
3 | 10211020202011010202121 |
4 | 211100100020333320 |
5 | 1123410241122404 |
6 | 30213134411024 |
7 | 2614156600630 |
oct | 452020107770 |
9 | 124222133677 |
10 | 40001114104 |
11 | 15a6764a096 |
12 | 7904360a74 |
13 | 3a063826b3 |
14 | 1d167bb6c0 |
15 | 1091b56e54 |
hex | 950408ff8 |
40001114104 has 128 divisors (see below), whose sum is σ = 93797084160. Its totient is φ = 15600273408.
The previous prime is 40001114063. The next prime is 40001114107. The reversal of 40001114104 is 40141110004.
It is a super-2 number, since 2×400011141042 (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 (40001114107) 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, 5738029 + ... + 5744995.
It is an arithmetic number, because the mean of its divisors is an integer number (732789720).
Almost surely, 240001114104 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 40001114104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46898542080).
40001114104 is an abundant number, since it is smaller than the sum of its proper divisors (53795970056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40001114104 is a wasteful number, since it uses less digits than its factorization.
40001114104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7197 (or 7193 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 40001114104 its reverse (40141110004), we get a palindrome (80142224108).
The spelling of 40001114104 in words is "forty billion, one million, one hundred fourteen thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •