Base | Representation |
---|---|
bin | 10101011111110000… |
… | …00010100110010101 |
3 | 1002210021202011021210 |
4 | 22233320002212111 |
5 | 142113400404401 |
6 | 5145055532033 |
7 | 555662543136 |
oct | 125770024625 |
9 | 32707664253 |
10 | 11540638101 |
11 | 4992431243 |
12 | 22a0b2a019 |
13 | 111bc3a855 |
14 | 7b6a03c8d |
15 | 4782834d6 |
hex | 2afe02995 |
11540638101 has 4 divisors (see below), whose sum is σ = 15387517472. Its totient is φ = 7693758732.
The previous prime is 11540638063. The next prime is 11540638157. The reversal of 11540638101 is 10183604511.
11540638101 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 11540638101 - 213 = 11540629909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11540638201) 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, 1923439681 + ... + 1923439686.
It is an arithmetic number, because the mean of its divisors is an integer number (3846879368).
Almost surely, 211540638101 is an apocalyptic number.
It is an amenable number.
11540638101 is a deficient number, since it is larger than the sum of its proper divisors (3846879371).
11540638101 is an equidigital number, since it uses as much as digits as its factorization.
11540638101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3846879370.
The product of its (nonzero) digits is 2880, while the sum is 30.
The spelling of 11540638101 in words is "eleven billion, five hundred forty million, six hundred thirty-eight thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •