Base | Representation |
---|---|
bin | 1000000000101100… |
… | …1001000011011001 |
3 | 12112212100212011012 |
4 | 2000023021003121 |
5 | 13401000414223 |
6 | 553214343305 |
7 | 104201064221 |
oct | 20013110331 |
9 | 5485325135 |
10 | 2150404313 |
11 | a03935652 |
12 | 5001bab35 |
13 | 2836882b5 |
14 | 16584b081 |
15 | c8bc1c78 |
hex | 802c90d9 |
2150404313 has 2 divisors, whose sum is σ = 2150404314. Its totient is φ = 2150404312.
The previous prime is 2150404283. The next prime is 2150404331. The reversal of 2150404313 is 3134040512.
Together with next prime (2150404331) 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., 2009459929 + 140944384 = 44827^2 + 11872^2 .
It is a cyclic number.
It is not a de Polignac number, because 2150404313 - 214 = 2150387929 is a prime.
It is not a weakly prime, because it can be changed into another prime (2150404913) 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, 1075202156 + 1075202157.
It is an arithmetic number, because the mean of its divisors is an integer number (1075202157).
Almost surely, 22150404313 is an apocalyptic number.
It is an amenable number.
2150404313 is a deficient number, since it is larger than the sum of its proper divisors (1).
2150404313 is an equidigital number, since it uses as much as digits as its factorization.
2150404313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 2150404313 is about 46372.4520917322. The cubic root of 2150404313 is about 1290.7437797553.
Adding to 2150404313 its reverse (3134040512), we get a palindrome (5284444825).
The spelling of 2150404313 in words is "two billion, one hundred fifty million, four hundred four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •