Base | Representation |
---|---|
bin | 101110111000110110000… |
… | …010100101101101010111 |
3 | 102102000212221001011112202 |
4 | 232320312002211231113 |
5 | 410242411310323112 |
6 | 10504121013435115 |
7 | 451535303061344 |
oct | 56706602455527 |
9 | 12360787034482 |
10 | 3222132120407 |
11 | 1032553643582 |
12 | 44057963ba9b |
13 | 1a4acc17c9c5 |
14 | b1d4850b7cb |
15 | 58c35be36c2 |
hex | 2ee360a5b57 |
3222132120407 has 2 divisors, whose sum is σ = 3222132120408. Its totient is φ = 3222132120406.
The previous prime is 3222132120331. The next prime is 3222132120479. The reversal of 3222132120407 is 7040212312223.
3222132120407 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3222132120407 - 210 = 3222132119383 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3222132120407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3222132120497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1611066060203 + 1611066060204.
It is an arithmetic number, because the mean of its divisors is an integer number (1611066060204).
Almost surely, 23222132120407 is an apocalyptic number.
3222132120407 is a deficient number, since it is larger than the sum of its proper divisors (1).
3222132120407 is an equidigital number, since it uses as much as digits as its factorization.
3222132120407 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 29.
The spelling of 3222132120407 in words is "three trillion, two hundred twenty-two billion, one hundred thirty-two million, one hundred twenty thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •