Base | Representation |
---|---|
bin | 111010011101110… |
… | …1110100111100001 |
3 | 12001201111111120012 |
4 | 1310323232213201 |
5 | 13004211030442 |
6 | 522400254305 |
7 | 66421101536 |
oct | 16473564741 |
9 | 5051444505 |
10 | 1961814497 |
11 | 9174362a5 |
12 | 469011395 |
13 | 2535976a6 |
14 | 148798d8d |
15 | b736d582 |
hex | 74eee9e1 |
1961814497 has 2 divisors, whose sum is σ = 1961814498. Its totient is φ = 1961814496.
The previous prime is 1961814493. The next prime is 1961814521. The reversal of 1961814497 is 7944181691.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 996096721 + 965717776 = 31561^2 + 31076^2 .
It is an emirp because it is prime and its reverse (7944181691) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1961814497 - 22 = 1961814493 is a prime.
It is a super-2 number, since 2×19618144972 = 7697432241278726018, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1961814493) 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, 980907248 + 980907249.
It is an arithmetic number, because the mean of its divisors is an integer number (980907249).
Almost surely, 21961814497 is an apocalyptic number.
It is an amenable number.
1961814497 is a deficient number, since it is larger than the sum of its proper divisors (1).
1961814497 is an equidigital number, since it uses as much as digits as its factorization.
1961814497 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 435456, while the sum is 50.
The square root of 1961814497 is about 44292.3751564533. The cubic root of 1961814497 is about 1251.8510169959.
The spelling of 1961814497 in words is "one billion, nine hundred sixty-one million, eight hundred fourteen thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •