Base | Representation |
---|---|
bin | 10100101011110100… |
… | …110100000001001001 |
3 | 2010022212020001022020 |
4 | 110223310310001021 |
5 | 330441241220241 |
6 | 14111515315053 |
7 | 1414246513662 |
oct | 245364640111 |
9 | 63285201266 |
10 | 22210101321 |
11 | 9468028941 |
12 | 437a14ba89 |
13 | 212c534cb5 |
14 | 1109a32369 |
15 | 89ecd0b66 |
hex | 52bd34049 |
22210101321 has 4 divisors (see below), whose sum is σ = 29613468432. Its totient is φ = 14806734212.
The previous prime is 22210101301. The next prime is 22210101337. The reversal of 22210101321 is 12310101222.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22210101321 - 26 = 22210101257 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22210101321.
It is not an unprimeable number, because it can be changed into a prime (22210101301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3701683551 + ... + 3701683556.
It is an arithmetic number, because the mean of its divisors is an integer number (7403367108).
Almost surely, 222210101321 is an apocalyptic number.
It is an amenable number.
22210101321 is a deficient number, since it is larger than the sum of its proper divisors (7403367111).
22210101321 is an equidigital number, since it uses as much as digits as its factorization.
22210101321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7403367110.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 22210101321 its reverse (12310101222), we get a palindrome (34520202543).
Subtracting from 22210101321 its reverse (12310101222), we obtain a palindrome (9900000099).
The spelling of 22210101321 in words is "twenty-two billion, two hundred ten million, one hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •