Base | Representation |
---|---|
bin | 10100101011100000… |
… | …10011001010111101 |
3 | 1001122202010102021221 |
4 | 22111300103022331 |
5 | 140214203314323 |
6 | 5033402553341 |
7 | 542061565441 |
oct | 122560231275 |
9 | 31582112257 |
10 | 11102401213 |
11 | 478801a3a2 |
12 | 219a208851 |
13 | 107c1cc097 |
14 | 774728821 |
15 | 44ea6a55d |
hex | 295c132bd |
11102401213 has 8 divisors (see below), whose sum is σ = 11209129920. Its totient is φ = 10995727680.
The previous prime is 11102401207. The next prime is 11102401217. The reversal of 11102401213 is 31210420111.
11102401213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11102401213 - 25 = 11102401181 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 (11102401217) 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 7 ways as a sum of consecutive naturals, for example, 472053 + ... + 495013.
It is an arithmetic number, because the mean of its divisors is an integer number (1401141240).
Almost surely, 211102401213 is an apocalyptic number.
It is an amenable number.
11102401213 is a deficient number, since it is larger than the sum of its proper divisors (106728707).
11102401213 is a wasteful number, since it uses less digits than its factorization.
11102401213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27587.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11102401213 its reverse (31210420111), we get a palindrome (42312821324).
The spelling of 11102401213 in words is "eleven billion, one hundred two million, four hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •