Base | Representation |
---|---|
bin | 1000101010010111… |
… | …0011011111101101 |
3 | 20000001012200012112 |
4 | 2022211303133231 |
5 | 14230220303221 |
6 | 1022420213405 |
7 | 111422404541 |
oct | 21245633755 |
9 | 6001180175 |
10 | 2325166061 |
11 | a9354a749 |
12 | 54a83a265 |
13 | 2b0946b0a |
14 | 180b3da21 |
15 | d91e315b |
hex | 8a9737ed |
2325166061 has 2 divisors, whose sum is σ = 2325166062. Its totient is φ = 2325166060.
The previous prime is 2325166049. The next prime is 2325166079. The reversal of 2325166061 is 1606615232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1857092836 + 468073225 = 43094^2 + 21635^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2325166061 is a prime.
It is a super-2 number, since 2×23251660612 = 10812794422452511442, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2325166661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1162583030 + 1162583031.
It is an arithmetic number, because the mean of its divisors is an integer number (1162583031).
Almost surely, 22325166061 is an apocalyptic number.
It is an amenable number.
2325166061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2325166061 is an equidigital number, since it uses as much as digits as its factorization.
2325166061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 2325166061 is about 48219.9757465721. The cubic root of 2325166061 is about 1324.8030676346.
The spelling of 2325166061 in words is "two billion, three hundred twenty-five million, one hundred sixty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •