Base | Representation |
---|---|
bin | 101100100010111001101… |
… | …110100000100011101101 |
3 | 101211122022121012210002112 |
4 | 230202321232200203231 |
5 | 400123144432113233 |
6 | 10302133121133405 |
7 | 434105502363656 |
oct | 54427156404355 |
9 | 11748277183075 |
10 | 3061132691693 |
11 | a8024566787a |
12 | 41532718a265 |
13 | 192881b45c5b |
14 | a8233d9852d |
15 | 54961639048 |
hex | 2c8b9ba08ed |
3061132691693 has 2 divisors, whose sum is σ = 3061132691694. Its totient is φ = 3061132691692.
The previous prime is 3061132691633. The next prime is 3061132691711. The reversal of 3061132691693 is 3961962311603.
3061132691693 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 can be written as a sum of positive squares in only one way, i.e., 2507339237764 + 553793453929 = 1583458^2 + 744173^2 .
It is a cyclic number.
It is not a de Polignac number, because 3061132691693 - 218 = 3061132429549 is a prime.
It is a super-3 number, since 3×30611326916933 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3061132691633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1530566345846 + 1530566345847.
It is an arithmetic number, because the mean of its divisors is an integer number (1530566345847).
Almost surely, 23061132691693 is an apocalyptic number.
It is an amenable number.
3061132691693 is a deficient number, since it is larger than the sum of its proper divisors (1).
3061132691693 is an equidigital number, since it uses as much as digits as its factorization.
3061132691693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 944784, while the sum is 50.
The spelling of 3061132691693 in words is "three trillion, sixty-one billion, one hundred thirty-two million, six hundred ninety-one thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •