Base | Representation |
---|---|
bin | 101110111000110100110… |
… | …101111000110000001001 |
3 | 102102000211112012121210212 |
4 | 232320310311320300021 |
5 | 410242341133411241 |
6 | 10504115014450505 |
7 | 451534640135165 |
oct | 56706465706011 |
9 | 12360745177725 |
10 | 3222112013321 |
11 | 103254325a853 |
12 | 440572963a35 |
13 | 1a4ac7c5c916 |
14 | b1d45995ca5 |
15 | 58c34070beb |
hex | 2ee34d78c09 |
3222112013321 has 2 divisors, whose sum is σ = 3222112013322. Its totient is φ = 3222112013320.
The previous prime is 3222112013273. The next prime is 3222112013347. The reversal of 3222112013321 is 1233102112223.
3222112013321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2478483462400 + 743628550921 = 1574320^2 + 862339^2 .
It is a cyclic number.
It is not a de Polignac number, because 3222112013321 - 214 = 3222111996937 is a prime.
It is not a weakly prime, because it can be changed into another prime (3222112013381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1611056006660 + 1611056006661.
It is an arithmetic number, because the mean of its divisors is an integer number (1611056006661).
Almost surely, 23222112013321 is an apocalyptic number.
It is an amenable number.
3222112013321 is a deficient number, since it is larger than the sum of its proper divisors (1).
3222112013321 is an equidigital number, since it uses as much as digits as its factorization.
3222112013321 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 23.
Adding to 3222112013321 its reverse (1233102112223), we get a palindrome (4455214125544).
The spelling of 3222112013321 in words is "three trillion, two hundred twenty-two billion, one hundred twelve million, thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •