Base | Representation |
---|---|
bin | 10101000100101111… |
… | …01001100101001101 |
3 | 1002012111100221112112 |
4 | 22202113221211031 |
5 | 141132343340323 |
6 | 5110403113405 |
7 | 550241531504 |
oct | 124227514515 |
9 | 32174327475 |
10 | 11314043213 |
11 | 4886534140 |
12 | 2239072865 |
13 | 10b4001435 |
14 | 79489b83b |
15 | 463424178 |
hex | 2a25e994d |
11314043213 has 8 divisors (see below), whose sum is σ = 12345574176. Its totient is φ = 10283009200.
The previous prime is 11314043207. The next prime is 11314043231. The reversal of 11314043213 is 31234041311.
11314043213 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 11314043213 - 24 = 11314043197 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 (11314043233) 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, 75806 + ... + 168447.
It is an arithmetic number, because the mean of its divisors is an integer number (1543196772).
Almost surely, 211314043213 is an apocalyptic number.
It is an amenable number.
11314043213 is a deficient number, since it is larger than the sum of its proper divisors (1031530963).
11314043213 is a wasteful number, since it uses less digits than its factorization.
11314043213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248475.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11314043213 its reverse (31234041311), we get a palindrome (42548084524).
The spelling of 11314043213 in words is "eleven billion, three hundred fourteen million, forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •