Base | Representation |
---|---|
bin | 1010001101110110001100… |
… | …0010010010001100000101 |
3 | 1110202212100011011222201210 |
4 | 2203131203002102030011 |
5 | 2433020141230202323 |
6 | 35520211444042033 |
7 | 2236362144200145 |
oct | 243354302221405 |
9 | 43685304158653 |
10 | 11233001022213 |
11 | 3640986262593 |
12 | 1315045393319 |
13 | 636362789bb9 |
14 | 2ab974492925 |
15 | 1472e1e4e293 |
hex | a3763092305 |
11233001022213 has 8 divisors (see below), whose sum is σ = 15188283072576. Its totient is φ = 7383193160000.
The previous prime is 11233001022211. The next prime is 11233001022247. The reversal of 11233001022213 is 31222010033211.
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 11233001022213 - 21 = 11233001022211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11233001022213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11233001022211) 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, 26368546788 + ... + 26368547213.
It is an arithmetic number, because the mean of its divisors is an integer number (1898535384072).
Almost surely, 211233001022213 is an apocalyptic number.
It is an amenable number.
11233001022213 is a deficient number, since it is larger than the sum of its proper divisors (3955282050363).
11233001022213 is an equidigital number, since it uses as much as digits as its factorization.
11233001022213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52737094075.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 11233001022213 its reverse (31222010033211), we get a palindrome (42455011055424).
The spelling of 11233001022213 in words is "eleven trillion, two hundred thirty-three billion, one million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •