Base | Representation |
---|---|
bin | 100101011000001111… |
… | …000001110001101111 |
3 | 10211121002011021201002 |
4 | 211120033001301233 |
5 | 1124144032240421 |
6 | 30234321110515 |
7 | 2620404132515 |
oct | 453017016157 |
9 | 124532137632 |
10 | 40135040111 |
11 | 16026202741 |
12 | 794118843b |
13 | 3a2804415a |
14 | 1d2a4c04b5 |
15 | 109d7adb0b |
hex | 9583c1c6f |
40135040111 has 4 divisors (see below), whose sum is σ = 40137484800. Its totient is φ = 40132595424.
The previous prime is 40135040107. The next prime is 40135040147. The reversal of 40135040111 is 11104053104.
It is a happy number.
40135040111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 40135040111 - 22 = 40135040107 is a prime.
It is a super-2 number, since 2×401350401112 (a number of 22 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 (40135040611) 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, 1197551 + ... + 1230608.
It is an arithmetic number, because the mean of its divisors is an integer number (10034371200).
Almost surely, 240135040111 is an apocalyptic number.
40135040111 is a deficient number, since it is larger than the sum of its proper divisors (2444689).
40135040111 is a wasteful number, since it uses less digits than its factorization.
40135040111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2444688.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 40135040111 its reverse (11104053104), we get a palindrome (51239093215).
The spelling of 40135040111 in words is "forty billion, one hundred thirty-five million, forty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •