Base | Representation |
---|---|
bin | 11010100110010010001… |
… | …00010001100111001001 |
3 | 10020100221201010210120002 |
4 | 31103021010101213021 |
5 | 104433140020023011 |
6 | 1535502014012345 |
7 | 123012311202515 |
oct | 15231104214711 |
9 | 3210851123502 |
10 | 913906407881 |
11 | 322649383975 |
12 | 1291554a70b5 |
13 | 6824788901c |
14 | 3233a299145 |
15 | 18b8d323c3b |
hex | d4c91119c9 |
913906407881 has 2 divisors, whose sum is σ = 913906407882. Its totient is φ = 913906407880.
The previous prime is 913906407863. The next prime is 913906407889. The reversal of 913906407881 is 188704609319.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 562026099856 + 351880308025 = 749684^2 + 593195^2 .
It is an emirp because it is prime and its reverse (188704609319) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 913906407881 - 238 = 639028500937 is a prime.
It is a super-2 number, since 2×9139064078812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (913906407889) 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, 456953203940 + 456953203941.
It is an arithmetic number, because the mean of its divisors is an integer number (456953203941).
Almost surely, 2913906407881 is an apocalyptic number.
It is an amenable number.
913906407881 is a deficient number, since it is larger than the sum of its proper divisors (1).
913906407881 is an equidigital number, since it uses as much as digits as its factorization.
913906407881 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2612736, while the sum is 56.
The spelling of 913906407881 in words is "nine hundred thirteen billion, nine hundred six million, four hundred seven thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •