Base | Representation |
---|---|
bin | 100101010110111101… |
… | …110000000111010101 |
3 | 10211112121001211100121 |
4 | 211112331300013111 |
5 | 1124123103442401 |
6 | 30232240311541 |
7 | 2620025054050 |
oct | 452675600725 |
9 | 124477054317 |
10 | 40113734101 |
11 | 16015180171 |
12 | 79360125b1 |
13 | 3a237c444c |
14 | 1d27735a97 |
15 | 109b9a0ca1 |
hex | 956f701d5 |
40113734101 has 4 divisors (see below), whose sum is σ = 45844267552. Its totient is φ = 34383200652.
The previous prime is 40113734093. The next prime is 40113734137. The reversal of 40113734101 is 10143731104.
It is a happy number.
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 40113734101 - 23 = 40113734093 is a prime.
It is a super-2 number, since 2×401137341012 (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 (40113734161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2865266715 + ... + 2865266728.
It is an arithmetic number, because the mean of its divisors is an integer number (11461066888).
Almost surely, 240113734101 is an apocalyptic number.
It is an amenable number.
40113734101 is a deficient number, since it is larger than the sum of its proper divisors (5730533451).
40113734101 is an equidigital number, since it uses as much as digits as its factorization.
40113734101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5730533450.
The product of its (nonzero) digits is 1008, while the sum is 25.
The spelling of 40113734101 in words is "forty billion, one hundred thirteen million, seven hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •