Base | Representation |
---|---|
bin | 1010010011100111000111… |
… | …0011110000011111011111 |
3 | 1111010022221212112211001122 |
4 | 2210321301303300133133 |
5 | 2441131000434321343 |
6 | 40033510353401155 |
7 | 2246466226142024 |
oct | 244716163603737 |
9 | 44108855484048 |
10 | 11332033120223 |
11 | 36799852a8592 |
12 | 1330282b691bb |
13 | 6427b58ba36a |
14 | 2b268ab5d54b |
15 | 149b8b1e8068 |
hex | a4e71cf07df |
11332033120223 has 8 divisors (see below), whose sum is σ = 11406100200000. Its totient is φ = 11258179799328.
The previous prime is 11332033120211. The next prime is 11332033120229. The reversal of 11332033120223 is 32202133023311.
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-11332033120223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11332033120192 and 11332033120201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11332033120229) 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, 53333348 + ... + 53545401.
It is an arithmetic number, because the mean of its divisors is an integer number (1425762525000).
Almost surely, 211332033120223 is an apocalyptic number.
11332033120223 is a deficient number, since it is larger than the sum of its proper divisors (74067079777).
11332033120223 is a wasteful number, since it uses less digits than its factorization.
11332033120223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106879441.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 11332033120223 its reverse (32202133023311), we get a palindrome (43534166143534).
The spelling of 11332033120223 in words is "eleven trillion, three hundred thirty-two billion, thirty-three million, one hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •