Base | Representation |
---|---|
bin | 100101100010101111… |
… | …000100110000111001 |
3 | 10212001100122210122002 |
4 | 211202233010300321 |
5 | 1130024132304423 |
6 | 30304013110345 |
7 | 2624643441443 |
oct | 454257046071 |
9 | 125040583562 |
10 | 40311213113 |
11 | 161066a1066 |
12 | 79901883b5 |
13 | 3a556a8132 |
14 | 1d45a5d493 |
15 | 10adead228 |
hex | 962bc4c39 |
40311213113 has 4 divisors (see below), whose sum is σ = 40325445108. Its totient is φ = 40296981120.
The previous prime is 40311213071. The next prime is 40311213119. The reversal of 40311213113 is 31131211304.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12418204969 + 27893008144 = 111437^2 + 167012^2 .
It is a cyclic number.
It is not a de Polignac number, because 40311213113 - 26 = 40311213049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40311213119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7111748 + ... + 7117413.
It is an arithmetic number, because the mean of its divisors is an integer number (10081361277).
Almost surely, 240311213113 is an apocalyptic number.
It is an amenable number.
40311213113 is a deficient number, since it is larger than the sum of its proper divisors (14231995).
40311213113 is a wasteful number, since it uses less digits than its factorization.
40311213113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14231994.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 40311213113 its reverse (31131211304), we get a palindrome (71442424417).
The spelling of 40311213113 in words is "forty billion, three hundred eleven million, two hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •