Base | Representation |
---|---|
bin | 1100000001100101010000… |
… | …1001011111001011001111 |
3 | 1201210221112121012211112220 |
4 | 3000121110021133023033 |
5 | 3213104231201011343 |
6 | 44041442512030423 |
7 | 2533131443114532 |
oct | 300312411371317 |
9 | 51727477184486 |
10 | 13221321110223 |
11 | 42381490a6646 |
12 | 1596469832413 |
13 | 74b9c429ba35 |
14 | 339cb5a46a19 |
15 | 17ddb4837183 |
hex | c065425f2cf |
13221321110223 has 16 divisors (see below), whose sum is σ = 18270971912160. Its totient is φ = 8497313237376.
The previous prime is 13221321110209. The next prime is 13221321110227. The reversal of 13221321110223 is 32201112312231.
It is not a de Polignac number, because 13221321110223 - 212 = 13221321106127 is a prime.
It is a super-3 number, since 3×132213211102233 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13221321110193 and 13221321110202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13221321110227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 546368640 + ... + 546392837.
It is an arithmetic number, because the mean of its divisors is an integer number (1141935744510).
Almost surely, 213221321110223 is an apocalyptic number.
13221321110223 is a deficient number, since it is larger than the sum of its proper divisors (5049650801937).
13221321110223 is a wasteful number, since it uses less digits than its factorization.
13221321110223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1092761626.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 13221321110223 its reverse (32201112312231), we get a palindrome (45422433422454).
The spelling of 13221321110223 in words is "thirteen trillion, two hundred twenty-one billion, three hundred twenty-one million, one hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •