Base | Representation |
---|---|
bin | 1001000110101111000010… |
… | …1001111101011110010111 |
3 | 1022110001221111111102012211 |
4 | 2101223300221331132113 |
5 | 2303011131200044343 |
6 | 33143044414054251 |
7 | 2052202425152326 |
oct | 221536051753627 |
9 | 38401844442184 |
10 | 10011311331223 |
11 | 320a856285644 |
12 | 1158313aaa387 |
13 | 5780a771a417 |
14 | 26879b4c20bd |
15 | 12563cecd79d |
hex | 91af0a7d797 |
10011311331223 has 8 divisors (see below), whose sum is σ = 10110228471200. Its totient is φ = 9912522741408.
The previous prime is 10011311331179. The next prime is 10011311331227. The reversal of 10011311331223 is 32213311311001.
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-10011311331223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10011311331194 and 10011311331203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011311331227) 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, 31981011 + ... + 32292532.
It is an arithmetic number, because the mean of its divisors is an integer number (1263778558900).
Almost surely, 210011311331223 is an apocalyptic number.
10011311331223 is a deficient number, since it is larger than the sum of its proper divisors (98917139977).
10011311331223 is a wasteful number, since it uses less digits than its factorization.
10011311331223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64275081.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10011311331223 its reverse (32213311311001), we get a palindrome (42224622642224).
The spelling of 10011311331223 in words is "ten trillion, eleven billion, three hundred eleven million, three hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •