Base | Representation |
---|---|
bin | 1001100100010111101010… |
… | …0011110011101110001101 |
3 | 1101020202001221012011010101 |
4 | 2121011322203303232031 |
5 | 2334331320331141044 |
6 | 34213004102011101 |
7 | 2134035043004224 |
oct | 231057243635615 |
9 | 41222057164111 |
10 | 10520431115149 |
11 | 339676510874a |
12 | 121ab1b116a91 |
13 | 5b40c3097c37 |
14 | 2852979bbcbb |
15 | 1339d959ecd4 |
hex | 9917a8f3b8d |
10520431115149 has 2 divisors, whose sum is σ = 10520431115150. Its totient is φ = 10520431115148.
The previous prime is 10520431115147. The next prime is 10520431115203. The reversal of 10520431115149 is 94151113402501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5606273211049 + 4914157904100 = 2367757^2 + 2216790^2 .
It is a cyclic number.
It is not a de Polignac number, because 10520431115149 - 21 = 10520431115147 is a prime.
It is a super-2 number, since 2×105204311151492 (a number of 27 digits) contains 22 as substring.
Together with 10520431115147, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10520431115147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5260215557574 + 5260215557575.
It is an arithmetic number, because the mean of its divisors is an integer number (5260215557575).
Almost surely, 210520431115149 is an apocalyptic number.
It is an amenable number.
10520431115149 is a deficient number, since it is larger than the sum of its proper divisors (1).
10520431115149 is an equidigital number, since it uses as much as digits as its factorization.
10520431115149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21600, while the sum is 37.
The spelling of 10520431115149 in words is "ten trillion, five hundred twenty billion, four hundred thirty-one million, one hundred fifteen thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •