Base | Representation |
---|---|
bin | 10010001011101001011… |
… | …011110000110010110001 |
3 | 11102110001210120011202201 |
4 | 102023221123300302301 |
5 | 130432341430304123 |
6 | 2353554221143201 |
7 | 156161464200616 |
oct | 22135133606261 |
9 | 4373053504681 |
10 | 1249456884913 |
11 | 4419899247a6 |
12 | 1821a06bab01 |
13 | 90a91987c53 |
14 | 4468ca7c50d |
15 | 2277ba4c5ad |
hex | 122e96f0cb1 |
1249456884913 has 2 divisors, whose sum is σ = 1249456884914. Its totient is φ = 1249456884912.
The previous prime is 1249456884859. The next prime is 1249456884931. The reversal of 1249456884913 is 3194886549421.
Together with next prime (1249456884931) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 851104037809 + 398352847104 = 922553^2 + 631152^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1249456884913 is a prime.
It is a super-2 number, since 2×12494568849132 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1249456884983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 624728442456 + 624728442457.
It is an arithmetic number, because the mean of its divisors is an integer number (624728442457).
Almost surely, 21249456884913 is an apocalyptic number.
It is an amenable number.
1249456884913 is a deficient number, since it is larger than the sum of its proper divisors (1).
1249456884913 is an equidigital number, since it uses as much as digits as its factorization.
1249456884913 is an evil number, because the sum of its binary digits is even.
The product of its digits is 59719680, while the sum is 64.
The spelling of 1249456884913 in words is "one trillion, two hundred forty-nine billion, four hundred fifty-six million, eight hundred eighty-four thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •