Base | Representation |
---|---|
bin | 11100000100110101001110… |
… | …01101101110010100010011 |
3 | 22002121011021201220100211222 |
4 | 32002122213031232110103 |
5 | 31043011241304232423 |
6 | 335150203513555255 |
7 | 16001320452250664 |
oct | 1602324715562423 |
9 | 262534251810758 |
10 | 61738665305363 |
11 | 1874324804a912 |
12 | 6b1144a115b2b |
13 | 285ac149a1777 |
14 | 113624b29d36b |
15 | 720e6eb133c8 |
hex | 3826a736e513 |
61738665305363 has 2 divisors, whose sum is σ = 61738665305364. Its totient is φ = 61738665305362.
The previous prime is 61738665305347. The next prime is 61738665305419. The reversal of 61738665305363 is 36350356683716.
61738665305363 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 61738665305363 - 24 = 61738665305347 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 61738665305296 and 61738665305305.
It is not a weakly prime, because it can be changed into another prime (61738665205363) 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, 30869332652681 + 30869332652682.
It is an arithmetic number, because the mean of its divisors is an integer number (30869332652682).
Almost surely, 261738665305363 is an apocalyptic number.
61738665305363 is a deficient number, since it is larger than the sum of its proper divisors (1).
61738665305363 is an equidigital number, since it uses as much as digits as its factorization.
61738665305363 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 146966400, while the sum is 62.
The spelling of 61738665305363 in words is "sixty-one trillion, seven hundred thirty-eight billion, six hundred sixty-five million, three hundred five thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •