Base | Representation |
---|---|
bin | 100101010110110110… |
… | …000010100101101110 |
3 | 10211112110021010102000 |
4 | 211112312002211232 |
5 | 1124122044300442 |
6 | 30232125113130 |
7 | 2620001634402 |
oct | 452666024556 |
9 | 124473233360 |
10 | 40111712622 |
11 | 1601401a423 |
12 | 79353b87a6 |
13 | 3a232672c7 |
14 | 1d2736b102 |
15 | 109b701d4c |
hex | 956d8296e |
40111712622 has 32 divisors (see below), whose sum is σ = 89282624160. Its totient is φ = 13348748160.
The previous prime is 40111712621. The next prime is 40111712647. The reversal of 40111712622 is 22621711104.
40111712622 is a `hidden beast` number, since 4 + 0 + 11 + 17 + 12 + 622 = 666.
40111712622 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×401117126222 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40111712621) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 572779 + ... + 638982.
It is an arithmetic number, because the mean of its divisors is an integer number (2790082005).
Almost surely, 240111712622 is an apocalyptic number.
40111712622 is an abundant number, since it is smaller than the sum of its proper divisors (49170911538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40111712622 is a wasteful number, since it uses less digits than its factorization.
40111712622 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1212385 (or 1212379 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The spelling of 40111712622 in words is "forty billion, one hundred eleven million, seven hundred twelve thousand, six hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •