Base | Representation |
---|---|
bin | 10010001111001111011110… |
… | …00111000111111110001101 |
3 | 12021000002220112210211121002 |
4 | 21013213233013013332031 |
5 | 20224044314020440122 |
6 | 221144255303150045 |
7 | 11306400033651002 |
oct | 1107475707077615 |
9 | 167002815724532 |
10 | 40106121265037 |
11 | 11862a019871a3 |
12 | 45b8a02a45325 |
13 | 194bcb6320909 |
14 | 9c920a4b38a9 |
15 | 4983bb544992 |
hex | 2479ef1c7f8d |
40106121265037 has 4 divisors (see below), whose sum is σ = 40109806484160. Its totient is φ = 40102436045916.
The previous prime is 40106121265031. The next prime is 40106121265051. The reversal of 40106121265037 is 73056212160104.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 40106121265037 - 26 = 40106121264973 is a prime.
It is a super-2 number, since 2×401061212650372 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40106121265031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1842593237 + ... + 1842615002.
It is an arithmetic number, because the mean of its divisors is an integer number (10027451621040).
Almost surely, 240106121265037 is an apocalyptic number.
It is an amenable number.
40106121265037 is a deficient number, since it is larger than the sum of its proper divisors (3685219123).
40106121265037 is a wasteful number, since it uses less digits than its factorization.
40106121265037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3685219122.
The product of its (nonzero) digits is 60480, while the sum is 38.
The spelling of 40106121265037 in words is "forty trillion, one hundred six billion, one hundred twenty-one million, two hundred sixty-five thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •