Base | Representation |
---|---|
bin | 10100001010100000… |
… | …10001011101000101 |
3 | 1000221110012221102101 |
4 | 22011100101131011 |
5 | 134132321220432 |
6 | 4550113312101 |
7 | 532160553625 |
oct | 120520213505 |
9 | 30843187371 |
10 | 10825570117 |
11 | 465583006a |
12 | 2121565631 |
13 | 1036a53bbb |
14 | 749a66885 |
15 | 4355d64e7 |
hex | 285411745 |
10825570117 has 4 divisors (see below), whose sum is σ = 10898225100. Its totient is φ = 10752915136.
The previous prime is 10825570111. The next prime is 10825570127. The reversal of 10825570117 is 71107552801.
It is a happy number.
It is a Cunningham number, because it is equal to 1040462+1.
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 1268356996 + 9557213121 = 35614^2 + 97761^2 .
It is a cyclic number.
It is not a de Polignac number, because 10825570117 - 227 = 10691352389 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 (10825570111) 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, 36327268 + ... + 36327565.
It is an arithmetic number, because the mean of its divisors is an integer number (2724556275).
Almost surely, 210825570117 is an apocalyptic number.
It is an amenable number.
10825570117 is a deficient number, since it is larger than the sum of its proper divisors (72654983).
10825570117 is an equidigital number, since it uses as much as digits as its factorization.
10825570117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72654982.
The product of its (nonzero) digits is 19600, while the sum is 37.
The spelling of 10825570117 in words is "ten billion, eight hundred twenty-five million, five hundred seventy thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •