Base | Representation |
---|---|
bin | 11011111000111101100100… |
… | …00000011100111001000011 |
3 | 22001011011120121102220202121 |
4 | 31330132302000130321003 |
5 | 31014321012031413441 |
6 | 334234554121425111 |
7 | 15630002001410503 |
oct | 1574366200347103 |
9 | 261134517386677 |
10 | 61330824482371 |
11 | 185a6290590114 |
12 | 6a663a903b197 |
13 | 282b619ab32c2 |
14 | 11205dba29a03 |
15 | 71554ebb2dd1 |
hex | 37c7b201ce43 |
61330824482371 has 2 divisors, whose sum is σ = 61330824482372. Its totient is φ = 61330824482370.
The previous prime is 61330824482341. The next prime is 61330824482399. The reversal of 61330824482371 is 17328442803316.
61330824482371 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 61330824482371 - 25 = 61330824482339 is a prime.
It is a super-2 number, since 2×613308244823712 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (61330824482341) 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, 30665412241185 + 30665412241186.
It is an arithmetic number, because the mean of its divisors is an integer number (30665412241186).
Almost surely, 261330824482371 is an apocalyptic number.
61330824482371 is a deficient number, since it is larger than the sum of its proper divisors (1).
61330824482371 is an equidigital number, since it uses as much as digits as its factorization.
61330824482371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4644864, while the sum is 52.
The spelling of 61330824482371 in words is "sixty-one trillion, three hundred thirty billion, eight hundred twenty-four million, four hundred eighty-two thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •