Base | Representation |
---|---|
bin | 11101110101011111011… |
… | …11010000010000100101 |
3 | 10122000002111202010110001 |
4 | 32322233233100100211 |
5 | 113244002024212423 |
6 | 2102540411301301 |
7 | 134031121315624 |
oct | 16725757202045 |
9 | 3560074663401 |
10 | 1025150616613 |
11 | 365844885462 |
12 | 146820a4a831 |
13 | 75895a887c6 |
14 | 378907d96bb |
15 | 1b9ee78acad |
hex | eeafbd0425 |
1025150616613 has 2 divisors, whose sum is σ = 1025150616614. Its totient is φ = 1025150616612.
The previous prime is 1025150616587. The next prime is 1025150616631. The reversal of 1025150616613 is 3166160515201.
Together with next prime (1025150616631) 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., 962514042084 + 62636574529 = 981078^2 + 250273^2 .
It is a cyclic number.
It is not a de Polignac number, because 1025150616613 - 29 = 1025150616101 is a prime.
It is a super-2 number, since 2×10251506166132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1025150616683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 512575308306 + 512575308307.
It is an arithmetic number, because the mean of its divisors is an integer number (512575308307).
Almost surely, 21025150616613 is an apocalyptic number.
It is an amenable number.
1025150616613 is a deficient number, since it is larger than the sum of its proper divisors (1).
1025150616613 is an equidigital number, since it uses as much as digits as its factorization.
1025150616613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32400, while the sum is 37.
The spelling of 1025150616613 in words is "one trillion, twenty-five billion, one hundred fifty million, six hundred sixteen thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •