Base | Representation |
---|---|
bin | 10011000101100010… |
… | …01101000000001101 |
3 | 222110010112112112101 |
4 | 21202301031000031 |
5 | 131441213000302 |
6 | 4412444435101 |
7 | 511634030536 |
oct | 114261150015 |
9 | 28403475471 |
10 | 10247000077 |
11 | 4389189906 |
12 | 1b9b848a91 |
13 | c73c1c572 |
14 | 6d2c9b68d |
15 | 3ee8ed287 |
hex | 262c4d00d |
10247000077 has 4 divisors (see below), whose sum is σ = 10321795836. Its totient is φ = 10172204320.
The previous prime is 10247000051. The next prime is 10247000083. The reversal of 10247000077 is 77000074201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4284226116 + 5962773961 = 65454^2 + 77219^2 .
It is a cyclic number.
It is not a de Polignac number, because 10247000077 - 215 = 10246967309 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 (10247000017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37397674 + ... + 37397947.
It is an arithmetic number, because the mean of its divisors is an integer number (2580448959).
Almost surely, 210247000077 is an apocalyptic number.
It is an amenable number.
10247000077 is a deficient number, since it is larger than the sum of its proper divisors (74795759).
10247000077 is an equidigital number, since it uses as much as digits as its factorization.
10247000077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74795758.
The product of its (nonzero) digits is 2744, while the sum is 28.
Adding to 10247000077 its reverse (77000074201), we get a palindrome (87247074278).
The spelling of 10247000077 in words is "ten billion, two hundred forty-seven million, seventy-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •