Base | Representation |
---|---|
bin | 1011011001111000… |
… | …0111000110000101 |
3 | 21220100110112011212 |
4 | 2312132013012011 |
5 | 22232201043233 |
6 | 1223435141205 |
7 | 135602006006 |
oct | 26636070605 |
9 | 7810415155 |
10 | 3061346693 |
11 | 1331061099 |
12 | 7152a4805 |
13 | 39a313462 |
14 | 2108151ad |
15 | 12db60a48 |
hex | b6787185 |
3061346693 has 2 divisors, whose sum is σ = 3061346694. Its totient is φ = 3061346692.
The previous prime is 3061346677. The next prime is 3061346711. The reversal of 3061346693 is 3966431603.
3061346693 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 can be written as a sum of positive squares in only one way, i.e., 1705855204 + 1355491489 = 41302^2 + 36817^2 .
It is a cyclic number.
It is not a de Polignac number, because 3061346693 - 24 = 3061346677 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3061346693.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3061346623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1530673346 + 1530673347.
It is an arithmetic number, because the mean of its divisors is an integer number (1530673347).
Almost surely, 23061346693 is an apocalyptic number.
It is an amenable number.
3061346693 is a deficient number, since it is larger than the sum of its proper divisors (1).
3061346693 is an equidigital number, since it uses as much as digits as its factorization.
3061346693 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 209952, while the sum is 41.
The square root of 3061346693 is about 55329.4378518344. The cubic root of 3061346693 is about 1452.0141162647.
The spelling of 3061346693 in words is "three billion, sixty-one million, three hundred forty-six thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •