Base | Representation |
---|---|
bin | 10000001100100101001… |
… | …011010101000011110001 |
3 | 10221101220021222022212212 |
4 | 100030211023111003301 |
5 | 121213431141201442 |
6 | 2211151530501505 |
7 | 143261452040012 |
oct | 20144513250361 |
9 | 3841807868785 |
10 | 1113020256497 |
11 | 39a035a11456 |
12 | 15b864294895 |
13 | 80c5a420066 |
14 | 3bc287c7009 |
15 | 1de43aa4a82 |
hex | 103252d50f1 |
1113020256497 has 2 divisors, whose sum is σ = 1113020256498. Its totient is φ = 1113020256496.
The previous prime is 1113020256487. The next prime is 1113020256499. The reversal of 1113020256497 is 7946520203111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1087033526881 + 25986729616 = 1042609^2 + 161204^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113020256497 - 232 = 1108725289201 is a prime.
It is a super-2 number, since 2×11130202564972 (a number of 25 digits) contains 22 as substring.
Together with 1113020256499, 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 (1113020256499) 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, 556510128248 + 556510128249.
It is an arithmetic number, because the mean of its divisors is an integer number (556510128249).
Almost surely, 21113020256497 is an apocalyptic number.
It is an amenable number.
1113020256497 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113020256497 is an equidigital number, since it uses as much as digits as its factorization.
1113020256497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 41.
The spelling of 1113020256497 in words is "one trillion, one hundred thirteen billion, twenty million, two hundred fifty-six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •