Base | Representation |
---|---|
bin | 10010001100010001011100… |
… | …01111000101010111011110 |
3 | 12020122100120120212112021221 |
4 | 21012020232033011113132 |
5 | 20220411344340213042 |
6 | 221025344053043554 |
7 | 11266125626606332 |
oct | 1106105617052736 |
9 | 166570516775257 |
10 | 40004101101022 |
11 | 1182370a191a63 |
12 | 45a10906265ba |
13 | 19424a8126b66 |
14 | 9c42cd0297c2 |
15 | 4958e9cb2d67 |
hex | 24622e3c55de |
40004101101022 has 8 divisors (see below), whose sum is σ = 60006230865072. Its totient is φ = 20002024146000.
The previous prime is 40004101101007. The next prime is 40004101101071. The reversal of 40004101101022 is 22010110140004.
It is a happy number.
40004101101022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 40004101100987 and 40004101101005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11250754 + ... + 14373157.
It is an arithmetic number, because the mean of its divisors is an integer number (7500778858134).
Almost surely, 240004101101022 is an apocalyptic number.
40004101101022 is a deficient number, since it is larger than the sum of its proper divisors (20002129764050).
40004101101022 is a wasteful number, since it uses less digits than its factorization.
40004101101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26404514.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 40004101101022 its reverse (22010110140004), we get a palindrome (62014211241026).
The spelling of 40004101101022 in words is "forty trillion, four billion, one hundred one million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •