Base | Representation |
---|---|
bin | 1001001010110010111… |
… | …00000001010010000101 |
3 | 1010010011012102011102001 |
4 | 10211121130001102011 |
5 | 20130141440130432 |
6 | 400420233145301 |
7 | 31521546265126 |
oct | 4453134012205 |
9 | 1103135364361 |
10 | 315033130117 |
11 | 111671a97482 |
12 | 5107bb5b231 |
13 | 239274a7584 |
14 | 1136790c04d |
15 | 82dc3699e7 |
hex | 4959701485 |
315033130117 has 2 divisors, whose sum is σ = 315033130118. Its totient is φ = 315033130116.
The previous prime is 315033130073. The next prime is 315033130141. The reversal of 315033130117 is 711031330513.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 211306621761 + 103726508356 = 459681^2 + 322066^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-315033130117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (315033130177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157516565058 + 157516565059.
It is an arithmetic number, because the mean of its divisors is an integer number (157516565059).
Almost surely, 2315033130117 is an apocalyptic number.
It is an amenable number.
315033130117 is a deficient number, since it is larger than the sum of its proper divisors (1).
315033130117 is an equidigital number, since it uses as much as digits as its factorization.
315033130117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2835, while the sum is 28.
The spelling of 315033130117 in words is "three hundred fifteen billion, thirty-three million, one hundred thirty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •