Base | Representation |
---|---|
bin | 11010100100110001011… |
… | …00110011100100000001 |
3 | 10020021212011020102101221 |
4 | 31102120230303210001 |
5 | 104430004301332441 |
6 | 1535245305355041 |
7 | 122653226002525 |
oct | 15223054634401 |
9 | 3207764212357 |
10 | 913094949121 |
11 | 3222723269a3 |
12 | 128b69798a81 |
13 | 68148723604 |
14 | 322a05c9d85 |
15 | 18b41e868d1 |
hex | d498b33901 |
913094949121 has 2 divisors, whose sum is σ = 913094949122. Its totient is φ = 913094949120.
The previous prime is 913094949113. The next prime is 913094949187. The reversal of 913094949121 is 121949490319.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 894717351025 + 18377598096 = 945895^2 + 135564^2 .
It is a cyclic number.
It is not a de Polignac number, because 913094949121 - 23 = 913094949113 is a prime.
It is a super-2 number, since 2×9130949491212 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (913094949101) 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, 456547474560 + 456547474561.
It is an arithmetic number, because the mean of its divisors is an integer number (456547474561).
Almost surely, 2913094949121 is an apocalyptic number.
It is an amenable number.
913094949121 is a deficient number, since it is larger than the sum of its proper divisors (1).
913094949121 is an equidigital number, since it uses as much as digits as its factorization.
913094949121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 629856, while the sum is 52.
The spelling of 913094949121 in words is "nine hundred thirteen billion, ninety-four million, nine hundred forty-nine thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •