Base | Representation |
---|---|
bin | 1010010010100000010101… |
… | …0001000101001000100111 |
3 | 1111001111220200000010201122 |
4 | 2210220011101011020213 |
5 | 2440323042222034343 |
6 | 40021045114244155 |
7 | 2245224325153025 |
oct | 244500521051047 |
9 | 44044820003648 |
10 | 11313032221223 |
11 | 3671914838977 |
12 | 132865b72665b |
13 | 640a781c6665 |
14 | 2b17a742d715 |
15 | 149428032068 |
hex | a4a05445227 |
11313032221223 has 8 divisors (see below), whose sum is σ = 11399405996160. Its totient is φ = 11226978943480.
The previous prime is 11313032221213. The next prime is 11313032221307. The reversal of 11313032221223 is 32212223031311.
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 11313032221223 - 24 = 11313032221207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11313032221192 and 11313032221201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11313032221213) 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, 80053433 + ... + 80194626.
It is an arithmetic number, because the mean of its divisors is an integer number (1424925749520).
Almost surely, 211313032221223 is an apocalyptic number.
11313032221223 is a deficient number, since it is larger than the sum of its proper divisors (86373774937).
11313032221223 is a wasteful number, since it uses less digits than its factorization.
11313032221223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160248597.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 11313032221223 its reverse (32212223031311), we get a palindrome (43525255252534).
The spelling of 11313032221223 in words is "eleven trillion, three hundred thirteen billion, thirty-two million, two hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •