Base | Representation |
---|---|
bin | 11100100010001111011… |
… | …00111000110000101001 |
3 | 10110201201121222120200102 |
4 | 32101013230320300221 |
5 | 112030433101231044 |
6 | 2030225351515145 |
7 | 130556413116023 |
oct | 16210754706051 |
9 | 3421647876612 |
10 | 980455492649 |
11 | 348899624286 |
12 | 13a028688ab5 |
13 | 715c20919a9 |
14 | 3565084d013 |
15 | 1a7859c124e |
hex | e447b38c29 |
980455492649 has 2 divisors, whose sum is σ = 980455492650. Its totient is φ = 980455492648.
The previous prime is 980455492633. The next prime is 980455492651. The reversal of 980455492649 is 946294554089.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 925684515625 + 54770977024 = 962125^2 + 234032^2 .
It is a cyclic number.
It is not a de Polignac number, because 980455492649 - 24 = 980455492633 is a prime.
It is a super-2 number, since 2×9804554926492 (a number of 25 digits) contains 22 as substring.
Together with 980455492651, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (980455492609) 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, 490227746324 + 490227746325.
It is an arithmetic number, because the mean of its divisors is an integer number (490227746325).
Almost surely, 2980455492649 is an apocalyptic number.
It is an amenable number.
980455492649 is a deficient number, since it is larger than the sum of its proper divisors (1).
980455492649 is an equidigital number, since it uses as much as digits as its factorization.
980455492649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 111974400, while the sum is 65.
The spelling of 980455492649 in words is "nine hundred eighty billion, four hundred fifty-five million, four hundred ninety-two thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •