Base | Representation |
---|---|
bin | 10001110010100001111… |
… | …11010110010111011101 |
3 | 2011102201122200112211202 |
4 | 20321100333112113131 |
5 | 40003311444434442 |
6 | 1144445055125245 |
7 | 62106125315201 |
oct | 10712077262735 |
9 | 2142648615752 |
10 | 611244139997 |
11 | 216255422387 |
12 | 9a568513825 |
13 | 4584232519a |
14 | 21827746b01 |
15 | 10d77084c32 |
hex | 8e50fd65dd |
611244139997 has 2 divisors, whose sum is σ = 611244139998. Its totient is φ = 611244139996.
The previous prime is 611244139991. The next prime is 611244140053. The reversal of 611244139997 is 799931442116.
It is a happy number.
It is an a-pointer prime, because the next prime (611244140053) can be obtained adding 611244139997 to its sum of digits (56).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 576853921081 + 34390218916 = 759509^2 + 185446^2 .
It is a cyclic number.
It is not a de Polignac number, because 611244139997 - 220 = 611243091421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (611244139991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 305622069998 + 305622069999.
It is an arithmetic number, because the mean of its divisors is an integer number (305622069999).
Almost surely, 2611244139997 is an apocalyptic number.
It is an amenable number.
611244139997 is a deficient number, since it is larger than the sum of its proper divisors (1).
611244139997 is an equidigital number, since it uses as much as digits as its factorization.
611244139997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2939328, while the sum is 56.
The spelling of 611244139997 in words is "six hundred eleven billion, two hundred forty-four million, one hundred thirty-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •