Base | Representation |
---|---|
bin | 11100000101011011010010… |
… | …01110101001001110010011 |
3 | 22002200010000212202100112101 |
4 | 32002231221032221032103 |
5 | 31043330114122230411 |
6 | 335203423340341231 |
7 | 16002643035043561 |
oct | 1602555116511623 |
9 | 262603025670471 |
10 | 61759100195731 |
11 | 18750984005464 |
12 | 6b153b1844817 |
13 | 285cb204b5883 |
14 | 113722922ca31 |
15 | 721768b358c1 |
hex | 382b693a9393 |
61759100195731 has 2 divisors, whose sum is σ = 61759100195732. Its totient is φ = 61759100195730.
The previous prime is 61759100195669. The next prime is 61759100195773. The reversal of 61759100195731 is 13759100195716.
61759100195731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 61759100195731 - 27 = 61759100195603 is a prime.
It is a super-2 number, since 2×617591001957312 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (61759100195431) 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, 30879550097865 + 30879550097866.
It is an arithmetic number, because the mean of its divisors is an integer number (30879550097866).
Almost surely, 261759100195731 is an apocalyptic number.
61759100195731 is a deficient number, since it is larger than the sum of its proper divisors (1).
61759100195731 is an equidigital number, since it uses as much as digits as its factorization.
61759100195731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1786050, while the sum is 55.
The spelling of 61759100195731 in words is "sixty-one trillion, seven hundred fifty-nine billion, one hundred million, one hundred ninety-five thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •