Base | Representation |
---|---|
bin | 110110011101011… |
… | …101000101011001 |
3 | 2100200021022101021 |
4 | 312131131011121 |
5 | 3332401102334 |
6 | 230355322441 |
7 | 31433150032 |
oct | 6635350531 |
9 | 2320238337 |
10 | 913690969 |
11 | 429833604 |
12 | 215bb0421 |
13 | 1173ab259 |
14 | 894c1a89 |
15 | 553333b4 |
hex | 3675d159 |
913690969 has 2 divisors, whose sum is σ = 913690970. Its totient is φ = 913690968.
The previous prime is 913690909. The next prime is 913691017. The reversal of 913690969 is 969096319.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 597313600 + 316377369 = 24440^2 + 17787^2 .
It is an emirp because it is prime and its reverse (969096319) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 913690969 - 221 = 911593817 is a prime.
It is a super-3 number, since 3×9136909693 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (913690909) 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, 456845484 + 456845485.
It is an arithmetic number, because the mean of its divisors is an integer number (456845485).
Almost surely, 2913690969 is an apocalyptic number.
It is an amenable number.
913690969 is a deficient number, since it is larger than the sum of its proper divisors (1).
913690969 is an equidigital number, since it uses as much as digits as its factorization.
913690969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 708588, while the sum is 52.
The square root of 913690969 is about 30227.3215651007. The cubic root of 913690969 is about 970.3605026263.
The spelling of 913690969 in words is "nine hundred thirteen million, six hundred ninety thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •