Base | Representation |
---|---|
bin | 111000111001100010… |
… | …011000000101001111 |
3 | 12211200210202012110002 |
4 | 320321202120011033 |
5 | 2000110240324431 |
6 | 44022214434515 |
7 | 4261662461522 |
oct | 707142300517 |
9 | 184623665402 |
10 | 61094854991 |
11 | 23a014a88a5 |
12 | ba10662a3b |
13 | 59b8529091 |
14 | 2d58052bb9 |
15 | 18c891e3cb |
hex | e3989814f |
61094854991 has 2 divisors, whose sum is σ = 61094854992. Its totient is φ = 61094854990.
The previous prime is 61094854987. The next prime is 61094854993. The reversal of 61094854991 is 19945849016.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 61094854991 - 22 = 61094854987 is a prime.
It is a super-2 number, since 2×610948549912 (a number of 22 digits) contains 22 as substring.
Together with 61094854993, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61094854993) 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, 30547427495 + 30547427496.
It is an arithmetic number, because the mean of its divisors is an integer number (30547427496).
Almost surely, 261094854991 is an apocalyptic number.
61094854991 is a deficient number, since it is larger than the sum of its proper divisors (1).
61094854991 is an equidigital number, since it uses as much as digits as its factorization.
61094854991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2799360, while the sum is 56.
The spelling of 61094854991 in words is "sixty-one billion, ninety-four million, eight hundred fifty-four thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •