Base | Representation |
---|---|
bin | 11100000100001010011100… |
… | …11001000100000010101111 |
3 | 22002111222000021010122200012 |
4 | 32002011032121010002233 |
5 | 31042122223232103411 |
6 | 335131445025323435 |
7 | 15666545404542611 |
oct | 1602051631040257 |
9 | 262458007118605 |
10 | 61715700269231 |
11 | 18734532971308 |
12 | 6b08abb19657b |
13 | 28589c4c34aa8 |
14 | 11350ad2b2db1 |
15 | 72057890d18b |
hex | 38214e6440af |
61715700269231 has 2 divisors, whose sum is σ = 61715700269232. Its totient is φ = 61715700269230.
The previous prime is 61715700269161. The next prime is 61715700269243. The reversal of 61715700269231 is 13296200751716.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 61715700269231 - 226 = 61715633160367 is a prime.
It is a super-2 number, since 2×617157002692312 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 61715700269231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61715700269131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30857850134615 + 30857850134616.
It is an arithmetic number, because the mean of its divisors is an integer number (30857850134616).
Almost surely, 261715700269231 is an apocalyptic number.
61715700269231 is a deficient number, since it is larger than the sum of its proper divisors (1).
61715700269231 is an equidigital number, since it uses as much as digits as its factorization.
61715700269231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 952560, while the sum is 50.
The spelling of 61715700269231 in words is "sixty-one trillion, seven hundred fifteen billion, seven hundred million, two hundred sixty-nine thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •