Base | Representation |
---|---|
bin | 1010010011100111110011… |
… | …1101100001101001001111 |
3 | 1111010100102220121222201122 |
4 | 2210321330331201221033 |
5 | 2441131341334331343 |
6 | 40033541120031155 |
7 | 2246503660432154 |
oct | 244717475415117 |
9 | 44110386558648 |
10 | 11332220230223 |
11 | 3679a70987052 |
12 | 13303157624bb |
13 | 6428155b0539 |
14 | 2b26a794822b |
15 | 149b9c858068 |
hex | a4e7cf61a4f |
11332220230223 has 8 divisors (see below), whose sum is σ = 11895733398528. Its totient is φ = 10774607723704.
The previous prime is 11332220230213. The next prime is 11332220230229. The reversal of 11332220230223 is 32203202223311.
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 11332220230223 - 230 = 11331146488399 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11332220230192 and 11332220230201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11332220230229) 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, 1475161511 + ... + 1475169192.
It is an arithmetic number, because the mean of its divisors is an integer number (1486966674816).
Almost surely, 211332220230223 is an apocalyptic number.
11332220230223 is a deficient number, since it is larger than the sum of its proper divisors (563513168305).
11332220230223 is a wasteful number, since it uses less digits than its factorization.
11332220230223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2950330893.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 11332220230223 its reverse (32203202223311), we get a palindrome (43535422453534).
The spelling of 11332220230223 in words is "eleven trillion, three hundred thirty-two billion, two hundred twenty million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •