Base | Representation |
---|---|
bin | 1000101010110001… |
… | …1110110100011101 |
3 | 20000011111121012012 |
4 | 2022230132310131 |
5 | 14231142311011 |
6 | 1022521521005 |
7 | 111443314526 |
oct | 21254366435 |
9 | 6004447165 |
10 | 2326916381 |
11 | a94535799 |
12 | 54b343165 |
13 | 2b110a6ca |
14 | 18107784d |
15 | d943ba8b |
hex | 8ab1ed1d |
2326916381 has 2 divisors, whose sum is σ = 2326916382. Its totient is φ = 2326916380.
The previous prime is 2326916357. The next prime is 2326916387. The reversal of 2326916381 is 1836196232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1759047481 + 567868900 = 41941^2 + 23830^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2326916381 is a prime.
It is a super-2 number, since 2×23269163812 = 10829079688332274322, 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 (2326916387) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1163458190 + 1163458191.
It is an arithmetic number, because the mean of its divisors is an integer number (1163458191).
Almost surely, 22326916381 is an apocalyptic number.
It is an amenable number.
2326916381 is a deficient number, since it is larger than the sum of its proper divisors (1).
2326916381 is an equidigital number, since it uses as much as digits as its factorization.
2326916381 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 93312, while the sum is 41.
The square root of 2326916381 is about 48238.1216570463. The cubic root of 2326916381 is about 1325.1354091588.
The spelling of 2326916381 in words is "two billion, three hundred twenty-six million, nine hundred sixteen thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •