Base | Representation |
---|---|
bin | 1010001100101100011100… |
… | …0011111011110111111111 |
3 | 1110200222020111020100100201 |
4 | 2203023013003323313333 |
5 | 2432204120302341343 |
6 | 35503135220304331 |
7 | 2235061441160134 |
oct | 243130703736777 |
9 | 43628214210321 |
10 | 11213204340223 |
11 | 3633547582386 |
12 | 131123b5420a7 |
13 | 63452925b8a2 |
14 | 2aaa171b458b |
15 | 146a33e9594d |
hex | a32c70fbdff |
11213204340223 has 8 divisors (see below), whose sum is σ = 11293512021792. Its totient is φ = 11133053358336.
The previous prime is 11213204340181. The next prime is 11213204340281. The reversal of 11213204340223 is 32204340231211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11213204340223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11213204340191 and 11213204340200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11213204343223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39031290 + ... + 39317527.
It is an arithmetic number, because the mean of its divisors is an integer number (1411689002724).
Almost surely, 211213204340223 is an apocalyptic number.
11213204340223 is a deficient number, since it is larger than the sum of its proper divisors (80307681569).
11213204340223 is an equidigital number, since it uses as much as digits as its factorization.
11213204340223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78349841.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 11213204340223 its reverse (32204340231211), we get a palindrome (43417544571434).
The spelling of 11213204340223 in words is "eleven trillion, two hundred thirteen billion, two hundred four million, three hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.275 sec. • engine limits •