Base | Representation |
---|---|
bin | 1000010100001011… |
… | …0010010011011101 |
3 | 12202120002102122122 |
4 | 2011002302103131 |
5 | 14032404200221 |
6 | 1005253352325 |
7 | 106212352232 |
oct | 20502622335 |
9 | 5676072578 |
10 | 2232100061 |
11 | a45a648a4 |
12 | 5236386a5 |
13 | 297590489 |
14 | 172635789 |
15 | d0e5ceab |
hex | 850b24dd |
2232100061 has 2 divisors, whose sum is σ = 2232100062. Its totient is φ = 2232100060.
The previous prime is 2232100019. The next prime is 2232100063. The reversal of 2232100061 is 1600012322.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2189772025 + 42328036 = 46795^2 + 6506^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2232100061 is a prime.
It is a super-3 number, since 3×22321000613 (a number of 29 digits) contains 333 as substring.
Together with 2232100063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2232100063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1116050030 + 1116050031.
It is an arithmetic number, because the mean of its divisors is an integer number (1116050031).
Almost surely, 22232100061 is an apocalyptic number.
It is an amenable number.
2232100061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2232100061 is an equidigital number, since it uses as much as digits as its factorization.
2232100061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2232100061 is about 47245.1062121782. The cubic root of 2232100061 is about 1306.8865441610.
Adding to 2232100061 its reverse (1600012322), we get a palindrome (3832112383).
The spelling of 2232100061 in words is "two billion, two hundred thirty-two million, one hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •