Base | Representation |
---|---|
bin | 100101011001110110… |
… | …011111100000010111 |
3 | 10211122222012020220211 |
4 | 211121312133200113 |
5 | 1124223003201321 |
6 | 30241130310251 |
7 | 2621153515246 |
oct | 453166374027 |
9 | 124588166824 |
10 | 40162162711 |
11 | 1603a548310 |
12 | 794a288387 |
13 | 3a3084c528 |
14 | 1d2dd4095d |
15 | 10a0d6a0e1 |
hex | 959d9f817 |
40162162711 has 4 divisors (see below), whose sum is σ = 43813268424. Its totient is φ = 36511057000.
The previous prime is 40162162661. The next prime is 40162162763. The reversal of 40162162711 is 11726126104.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 40162162711 - 29 = 40162162199 is a prime.
It is a super-2 number, since 2×401621627112 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40162162111) 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, 1825552840 + ... + 1825552861.
It is an arithmetic number, because the mean of its divisors is an integer number (10953317106).
Almost surely, 240162162711 is an apocalyptic number.
40162162711 is a deficient number, since it is larger than the sum of its proper divisors (3651105713).
40162162711 is a wasteful number, since it uses less digits than its factorization.
40162162711 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3651105712.
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 40162162711 its reverse (11726126104), we get a palindrome (51888288815).
The spelling of 40162162711 in words is "forty billion, one hundred sixty-two million, one hundred sixty-two thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •