Base | Representation |
---|---|
bin | 10100101011011101… |
… | …10100101100100001 |
3 | 1001122201101202110122 |
4 | 22111232310230201 |
5 | 140214103423431 |
6 | 5033350410025 |
7 | 542055364313 |
oct | 122556645441 |
9 | 31581352418 |
10 | 11102014241 |
11 | 478788568a |
12 | 219a060915 |
13 | 107c0c4bc6 |
14 | 7746677b3 |
15 | 44e9e0a7b |
hex | 295bb4b21 |
11102014241 has 4 divisors (see below), whose sum is σ = 11686330800. Its totient is φ = 10517697684.
The previous prime is 11102014229. The next prime is 11102014249. The reversal of 11102014241 is 14241020111.
11102014241 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 a de Polignac number, because none of the positive numbers 2k-11102014241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11102014249) 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, 292158251 + ... + 292158288.
It is an arithmetic number, because the mean of its divisors is an integer number (2921582700).
Almost surely, 211102014241 is an apocalyptic number.
It is an amenable number.
11102014241 is a deficient number, since it is larger than the sum of its proper divisors (584316559).
11102014241 is an equidigital number, since it uses as much as digits as its factorization.
11102014241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584316558.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11102014241 its reverse (14241020111), we get a palindrome (25343034352).
The spelling of 11102014241 in words is "eleven billion, one hundred two million, fourteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •