Base | Representation |
---|---|
bin | 1010001101010001110010… |
… | …1001100110011111000001 |
3 | 1110201221010012200101221021 |
4 | 2203110130221212133001 |
5 | 2432340133413241113 |
6 | 35511514125425441 |
7 | 2235565051525120 |
oct | 243243451463701 |
9 | 43657105611837 |
10 | 11223230212033 |
11 | 3637821958254 |
12 | 131317910b281 |
13 | 635466407008 |
14 | 2ab2c894dab7 |
15 | 146e1e26448d |
hex | a351ca667c1 |
11223230212033 has 8 divisors (see below), whose sum is σ = 12920173258752. Its totient is φ = 9549693276576.
The previous prime is 11223230212021. The next prime is 11223230212049. The reversal of 11223230212033 is 33021203232211.
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 11223230212033 - 221 = 11223228114881 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11223230211989 and 11223230212007.
It is not an unprimeable number, because it can be changed into a prime (11223230212003) 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, 5851526785 + ... + 5851528702.
It is an arithmetic number, because the mean of its divisors is an integer number (1615021657344).
Almost surely, 211223230212033 is an apocalyptic number.
It is an amenable number.
11223230212033 is a deficient number, since it is larger than the sum of its proper divisors (1696943046719).
11223230212033 is a wasteful number, since it uses less digits than its factorization.
11223230212033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11703055631.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 11223230212033 its reverse (33021203232211), we get a palindrome (44244433444244).
The spelling of 11223230212033 in words is "eleven trillion, two hundred twenty-three billion, two hundred thirty million, two hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •