Base | Representation |
---|---|
bin | 1010000110011001111010… |
… | …00111010111110011110001 |
3 | 2220122021200002011202120011 |
4 | 11003030331013113303301 |
5 | 10402343144103332241 |
6 | 115123134352214521 |
7 | 4451432653341301 |
oct | 503147507276361 |
9 | 86567602152504 |
10 | 22210301230321 |
11 | 7093377028906 |
12 | 25a8608b3a441 |
13 | c51565093519 |
14 | 56adacd65601 |
15 | 287b1a849281 |
hex | 14333d1d7cf1 |
22210301230321 has 2 divisors, whose sum is σ = 22210301230322. Its totient is φ = 22210301230320.
The previous prime is 22210301230307. The next prime is 22210301230333. The reversal of 22210301230321 is 12303210301222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20526109830625 + 1684191399696 = 4530575^2 + 1297764^2 .
It is a cyclic number.
It is not a de Polignac number, because 22210301230321 - 27 = 22210301230193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22210301230292 and 22210301230301.
It is not a weakly prime, because it can be changed into another prime (22210301230301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11105150615160 + 11105150615161.
It is an arithmetic number, because the mean of its divisors is an integer number (11105150615161).
Almost surely, 222210301230321 is an apocalyptic number.
It is an amenable number.
22210301230321 is a deficient number, since it is larger than the sum of its proper divisors (1).
22210301230321 is an equidigital number, since it uses as much as digits as its factorization.
22210301230321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 22210301230321 its reverse (12303210301222), we get a palindrome (34513511531543).
The spelling of 22210301230321 in words is "twenty-two trillion, two hundred ten billion, three hundred one million, two hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •