Base | Representation |
---|---|
bin | 10010111010110000… |
… | …00010000000100001 |
3 | 222012211021102211121 |
4 | 21131120002000201 |
5 | 131300031442421 |
6 | 4355453212241 |
7 | 506454645646 |
oct | 113530020041 |
9 | 28184242747 |
10 | 10156515361 |
11 | 43420a7353 |
12 | 1b75491081 |
13 | c5b25ab05 |
14 | 6c4c65dcd |
15 | 3e69c7d41 |
hex | 25d602021 |
10156515361 has 2 divisors, whose sum is σ = 10156515362. Its totient is φ = 10156515360.
The previous prime is 10156515353. The next prime is 10156515373. The reversal of 10156515361 is 16351565101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10129214736 + 27300625 = 100644^2 + 5225^2 .
It is a cyclic number.
It is not a de Polignac number, because 10156515361 - 23 = 10156515353 is a prime.
It is not a weakly prime, because it can be changed into another prime (10156519361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5078257680 + 5078257681.
It is an arithmetic number, because the mean of its divisors is an integer number (5078257681).
Almost surely, 210156515361 is an apocalyptic number.
It is an amenable number.
10156515361 is a deficient number, since it is larger than the sum of its proper divisors (1).
10156515361 is an equidigital number, since it uses as much as digits as its factorization.
10156515361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 34.
The spelling of 10156515361 in words is "ten billion, one hundred fifty-six million, five hundred fifteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •