Base | Representation |
---|---|
bin | 1000101011011000… |
… | …1101000001101101 |
3 | 20000100022002011022 |
4 | 2022312031001231 |
5 | 14232320334231 |
6 | 1023052303525 |
7 | 111504060656 |
oct | 21266150155 |
9 | 6010262138 |
10 | 2329464941 |
11 | a95a16541 |
12 | 550171ba5 |
13 | 2b17c072b |
14 | 18153c52d |
15 | d9791c7b |
hex | 8ad8d06d |
2329464941 has 2 divisors, whose sum is σ = 2329464942. Its totient is φ = 2329464940.
The previous prime is 2329464887. The next prime is 2329464953. The reversal of 2329464941 is 1494649232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1807525225 + 521939716 = 42515^2 + 22846^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2329464941 is a prime.
It is a super-3 number, since 3×23294649413 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 2329464892 and 2329464901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2329464971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1164732470 + 1164732471.
It is an arithmetic number, because the mean of its divisors is an integer number (1164732471).
Almost surely, 22329464941 is an apocalyptic number.
It is an amenable number.
2329464941 is a deficient number, since it is larger than the sum of its proper divisors (1).
2329464941 is an equidigital number, since it uses as much as digits as its factorization.
2329464941 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 373248, while the sum is 44.
The square root of 2329464941 is about 48264.5308793114. The cubic root of 2329464941 is about 1325.6190184136.
The spelling of 2329464941 in words is "two billion, three hundred twenty-nine million, four hundred sixty-four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •