Base | Representation |
---|---|
bin | 1001001001101010011000… |
… | …1000010101100101100101 |
3 | 1022121212202020122111121221 |
4 | 2102122212020111211211 |
5 | 2304322124224020121 |
6 | 33222122511540341 |
7 | 2055632562034345 |
oct | 222324610254545 |
9 | 38555666574557 |
10 | 10061600610661 |
11 | 322a11226a606 |
12 | 116600982a6b1 |
13 | 57ca603a33c2 |
14 | 26adac3d4d25 |
15 | 126ad2e65b41 |
hex | 926a6215965 |
10061600610661 has 4 divisors (see below), whose sum is σ = 10109285921824. Its totient is φ = 10013915299500.
The previous prime is 10061600610619. The next prime is 10061600610679. The reversal of 10061600610661 is 16601600616001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10061600610661 - 227 = 10061466392933 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10061600670661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23842655265 + ... + 23842655686.
It is an arithmetic number, because the mean of its divisors is an integer number (2527321480456).
Almost surely, 210061600610661 is an apocalyptic number.
It is an amenable number.
10061600610661 is a deficient number, since it is larger than the sum of its proper divisors (47685311163).
10061600610661 is an equidigital number, since it uses as much as digits as its factorization.
10061600610661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47685311162.
The product of its (nonzero) digits is 7776, while the sum is 34.
The spelling of 10061600610661 in words is "ten trillion, sixty-one billion, six hundred million, six hundred ten thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •