Base | Representation |
---|---|
bin | 1001100110011000110110… |
… | …10111001011110011010001 |
3 | 2202202010011202111212010221 |
4 | 10303030123113023303101 |
5 | 10231332214132303241 |
6 | 112521522552553041 |
7 | 4306110004402600 |
oct | 463143327136321 |
9 | 82663152455127 |
10 | 21110223322321 |
11 | 67a98827a5441 |
12 | 244b3770b2781 |
13 | ba18bb10b153 |
14 | 52da513bba37 |
15 | 2691d31095d1 |
hex | 13331b5cbcd1 |
21110223322321 has 6 divisors (see below), whose sum is σ = 24556790395410. Its totient is φ = 18094477133376.
The previous prime is 21110223322303. The next prime is 21110223322333. The reversal of 21110223322321 is 12322332201112.
It can be written as a sum of positive squares in only one way, i.e., 18122355505296 + 2987867817025 = 4257036^2 + 1728545^2 .
It is not a de Polignac number, because 21110223322321 - 27 = 21110223322193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21110223322351) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 215410442016 + ... + 215410442113.
It is an arithmetic number, because the mean of its divisors is an integer number (4092798399235).
Almost surely, 221110223322321 is an apocalyptic number.
It is an amenable number.
21110223322321 is a deficient number, since it is larger than the sum of its proper divisors (3446567073089).
21110223322321 is an equidigital number, since it uses as much as digits as its factorization.
21110223322321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 430820884143 (or 430820884136 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 21110223322321 its reverse (12322332201112), we get a palindrome (33432555523433).
The spelling of 21110223322321 in words is "twenty-one trillion, one hundred ten billion, two hundred twenty-three million, three hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •