Base | Representation |
---|---|
bin | 1001010010111101010100… |
… | …1001110000110010011001 |
3 | 1100012010222012102212121220 |
4 | 2110233111021300302121 |
5 | 2314431212121201241 |
6 | 33423334002522253 |
7 | 2103315265364325 |
oct | 224572511606231 |
9 | 40163865385556 |
10 | 10221303303321 |
11 | 3290915278320 |
12 | 1190b59966389 |
13 | 591b31b75a06 |
14 | 2749dc636985 |
15 | 12ad2d777166 |
hex | 94bd5270c99 |
10221303303321 has 64 divisors (see below), whose sum is σ = 15084655488000. Its totient is φ = 6104896992000.
The previous prime is 10221303303301. The next prime is 10221303303331. The reversal of 10221303303321 is 12330330312201.
It is not a de Polignac number, because 10221303303321 - 215 = 10221303270553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221303303291 and 10221303303300.
It is not an unprimeable number, because it can be changed into a prime (10221303303301) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1299259230 + ... + 1299267096.
It is an arithmetic number, because the mean of its divisors is an integer number (235697742000).
Almost surely, 210221303303321 is an apocalyptic number.
10221303303321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10221303303321 is a deficient number, since it is larger than the sum of its proper divisors (4863352184679).
10221303303321 is a wasteful number, since it uses less digits than its factorization.
10221303303321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10070.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 10221303303321 its reverse (12330330312201), we get a palindrome (22551633615522).
The spelling of 10221303303321 in words is "ten trillion, two hundred twenty-one billion, three hundred three million, three hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •