Base | Representation |
---|---|
bin | 111010011100010… |
… | …1110111011011001 |
3 | 12001200000121112012 |
4 | 1310320232323121 |
5 | 13004010414322 |
6 | 522331355305 |
7 | 66411321461 |
oct | 16470567331 |
9 | 5050017465 |
10 | 1961029337 |
11 | 916a4a403 |
12 | 4688b2b35 |
13 | 2533811b7 |
14 | 148632ba1 |
15 | b7265ae2 |
hex | 74e2eed9 |
1961029337 has 2 divisors, whose sum is σ = 1961029338. Its totient is φ = 1961029336.
The previous prime is 1961029331. The next prime is 1961029361. The reversal of 1961029337 is 7339201691.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1588500736 + 372528601 = 39856^2 + 19301^2 .
It is a cyclic number.
It is not a de Polignac number, because 1961029337 - 222 = 1956835033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1961029294 and 1961029303.
It is not a weakly prime, because it can be changed into another prime (1961029331) 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, 980514668 + 980514669.
It is an arithmetic number, because the mean of its divisors is an integer number (980514669).
Almost surely, 21961029337 is an apocalyptic number.
It is an amenable number.
1961029337 is a deficient number, since it is larger than the sum of its proper divisors (1).
1961029337 is an equidigital number, since it uses as much as digits as its factorization.
1961029337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61236, while the sum is 41.
The square root of 1961029337 is about 44283.5108928820. The cubic root of 1961029337 is about 1251.6839888864.
The spelling of 1961029337 in words is "one billion, nine hundred sixty-one million, twenty-nine thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •