Base | Representation |
---|---|
bin | 11011101111010111011010… |
… | …01110101111110110101101 |
3 | 21222222122111221012110001001 |
4 | 31313223231032233312231 |
5 | 30443420231013312023 |
6 | 333423304313520301 |
7 | 15564120156240661 |
oct | 1567535516576655 |
9 | 258878457173031 |
10 | 61001105604013 |
11 | 184894728aa723 |
12 | 6a1250aa13091 |
13 | 28064c1c0a693 |
14 | 110c67d93a8a1 |
15 | 70bba340a6ad |
hex | 377aed3afdad |
61001105604013 has 2 divisors, whose sum is σ = 61001105604014. Its totient is φ = 61001105604012.
The previous prime is 61001105603983. The next prime is 61001105604053. The reversal of 61001105604013 is 31040650110016.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52705305864964 + 8295799739049 = 7259842^2 + 2880243^2 .
It is a cyclic number.
It is not a de Polignac number, because 61001105604013 - 241 = 58802082348461 is a prime.
It is a super-2 number, since 2×610011056040132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61001105604053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30500552802006 + 30500552802007.
It is an arithmetic number, because the mean of its divisors is an integer number (30500552802007).
Almost surely, 261001105604013 is an apocalyptic number.
It is an amenable number.
61001105604013 is a deficient number, since it is larger than the sum of its proper divisors (1).
61001105604013 is an equidigital number, since it uses as much as digits as its factorization.
61001105604013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 61001105604013 its reverse (31040650110016), we get a palindrome (92041755714029).
The spelling of 61001105604013 in words is "sixty-one trillion, one billion, one hundred five million, six hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •