Base | Representation |
---|---|
bin | 11000011111101011… |
… | …10000011100110101 |
3 | 1020221111021100110002 |
4 | 30033311300130311 |
5 | 203413031332323 |
6 | 10012532041045 |
7 | 643612461626 |
oct | 141765603465 |
9 | 36844240402 |
10 | 13150652213 |
11 | 5639222716 |
12 | 2670163185 |
13 | 131766b71a |
14 | 8ca783a4d |
15 | 51e7ae828 |
hex | 30fd70735 |
13150652213 has 2 divisors, whose sum is σ = 13150652214. Its totient is φ = 13150652212.
The previous prime is 13150652183. The next prime is 13150652231. The reversal of 13150652213 is 31225605131.
Together with next prime (13150652231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13110937009 + 39715204 = 114503^2 + 6302^2 .
It is a cyclic number.
It is not a de Polignac number, because 13150652213 - 26 = 13150652149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13150652513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6575326106 + 6575326107.
It is an arithmetic number, because the mean of its divisors is an integer number (6575326107).
Almost surely, 213150652213 is an apocalyptic number.
It is an amenable number.
13150652213 is a deficient number, since it is larger than the sum of its proper divisors (1).
13150652213 is an equidigital number, since it uses as much as digits as its factorization.
13150652213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 29.
The spelling of 13150652213 in words is "thirteen billion, one hundred fifty million, six hundred fifty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •