Base | Representation |
---|---|
bin | 10011100111011010… |
… | …10101110010011101 |
3 | 1000011221022101202021 |
4 | 21303231111302131 |
5 | 133031441401112 |
6 | 4501000100141 |
7 | 521654503312 |
oct | 116355256235 |
9 | 30157271667 |
10 | 10531200157 |
11 | 4514651605 |
12 | 205aa64651 |
13 | cbaa778aa |
14 | 71c91ad09 |
15 | 41983a907 |
hex | 273b55c9d |
10531200157 has 4 divisors (see below), whose sum is σ = 10894345020. Its totient is φ = 10168055296.
The previous prime is 10531200139. The next prime is 10531200203. The reversal of 10531200157 is 75100213501.
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 4813723161 + 5717476996 = 69381^2 + 75614^2 .
It is a cyclic number.
It is not a de Polignac number, because 10531200157 - 211 = 10531198109 is a prime.
It is a super-2 number, since 2×105312001572 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10531200257) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 181572388 + ... + 181572445.
It is an arithmetic number, because the mean of its divisors is an integer number (2723586255).
Almost surely, 210531200157 is an apocalyptic number.
It is an amenable number.
10531200157 is a deficient number, since it is larger than the sum of its proper divisors (363144863).
10531200157 is an equidigital number, since it uses as much as digits as its factorization.
10531200157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 363144862.
The product of its (nonzero) digits is 1050, while the sum is 25.
Adding to 10531200157 its reverse (75100213501), we get a palindrome (85631413658).
The spelling of 10531200157 in words is "ten billion, five hundred thirty-one million, two hundred thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •