Base | Representation |
---|---|
bin | 100000001100010001011… |
… | …101110111110110100101 |
3 | 21211111002002211202210002 |
4 | 200030101131313312211 |
5 | 242221042001413221 |
6 | 4412134325111045 |
7 | 315553256644565 |
oct | 40142135676645 |
9 | 7744062752702 |
10 | 2212201201061 |
11 | 7832099a6a25 |
12 | 2b88a5858485 |
13 | 1307c0602c37 |
14 | 790dd1a4da5 |
15 | 3c8276b780b |
hex | 20311777da5 |
2212201201061 has 2 divisors, whose sum is σ = 2212201201062. Its totient is φ = 2212201201060.
The previous prime is 2212201201043. The next prime is 2212201201109. The reversal of 2212201201061 is 1601021022122.
2212201201061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2198977581025 + 13223620036 = 1482895^2 + 114994^2 .
It is a cyclic number.
It is not a de Polignac number, because 2212201201061 - 238 = 1937323294117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2212201231061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1106100600530 + 1106100600531.
It is an arithmetic number, because the mean of its divisors is an integer number (1106100600531).
Almost surely, 22212201201061 is an apocalyptic number.
It is an amenable number.
2212201201061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212201201061 is an equidigital number, since it uses as much as digits as its factorization.
2212201201061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 2212201201061 its reverse (1601021022122), we get a palindrome (3813222223183).
The spelling of 2212201201061 in words is "two trillion, two hundred twelve billion, two hundred one million, two hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •