Base | Representation |
---|---|
bin | 10010011001110100010101… |
… | …01010001100011100011100 |
3 | 12022021211212121101202121201 |
4 | 21030322022222030130130 |
5 | 20301023023043222430 |
6 | 222023234014005244 |
7 | 11344553065526053 |
oct | 1114721252143434 |
9 | 168254777352551 |
10 | 40469508179740 |
11 | 11993027369712 |
12 | 46573184a6824 |
13 | 19773484a0533 |
14 | 9dca3dc2b39a |
15 | 4a2a889768ca |
hex | 24ce8aa8c71c |
40469508179740 has 96 divisors (see below), whose sum is σ = 89218766165760. Its totient is φ = 15398562816000.
The previous prime is 40469508179693. The next prime is 40469508179743. The reversal of 40469508179740 is 4797180596404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40469508179743) 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, 38047140 + ... + 39096340.
It is an arithmetic number, because the mean of its divisors is an integer number (929362147560).
Almost surely, 240469508179740 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 40469508179740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44609383082880).
40469508179740 is an abundant number, since it is smaller than the sum of its proper divisors (48749257986020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40469508179740 is a wasteful number, since it uses less digits than its factorization.
40469508179740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1050223 (or 1050221 counting only the distinct ones).
The product of its (nonzero) digits is 60963840, while the sum is 64.
The spelling of 40469508179740 in words is "forty trillion, four hundred sixty-nine billion, five hundred eight million, one hundred seventy-nine thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •