Base | Representation |
---|---|
bin | 110010010100101000010100… |
… | …000010101110110101100101 |
3 | 1002000121222121101220021110021 |
4 | 302110220110002232311211 |
5 | 213002101330230221313 |
6 | 2102413001014355141 |
7 | 64421561642036362 |
oct | 6224502402566545 |
9 | 1060558541807407 |
10 | 221320001023333 |
11 | 64579315860423 |
12 | 209a537065bab1 |
13 | 96655043126a4 |
14 | 3c91d338db469 |
15 | 1a8c093c1978d |
hex | c94a140aed65 |
221320001023333 has 16 divisors (see below), whose sum is σ = 222701206029120. Its totient is φ = 219940569561600.
The previous prime is 221320001023309. The next prime is 221320001023337. The reversal of 221320001023333 is 333320100023122.
It is a cyclic number.
It is not a de Polignac number, because 221320001023333 - 217 = 221320000892261 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221320001023298 and 221320001023307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221320001023337) 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, 2792324658 + ... + 2792403916.
It is an arithmetic number, because the mean of its divisors is an integer number (13918825376820).
Almost surely, 2221320001023333 is an apocalyptic number.
It is an amenable number.
221320001023333 is a deficient number, since it is larger than the sum of its proper divisors (1381205005787).
221320001023333 is a wasteful number, since it uses less digits than its factorization.
221320001023333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90228.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 221320001023333 its reverse (333320100023122), we get a palindrome (554640101046455).
The spelling of 221320001023333 in words is "two hundred twenty-one trillion, three hundred twenty billion, one million, twenty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •