Base | Representation |
---|---|
bin | 1001001011100100100… |
… | …10010111110000011101 |
3 | 1010011020020212221002102 |
4 | 10211302102113300131 |
5 | 20132020201444013 |
6 | 400525444534445 |
7 | 31535101011026 |
oct | 4456222276035 |
9 | 1104206787072 |
10 | 315450031133 |
11 | 111866356376 |
12 | 511776b1425 |
13 | 23992985873 |
14 | 113a7031c4d |
15 | 8313c6ad58 |
hex | 4972497c1d |
315450031133 has 2 divisors, whose sum is σ = 315450031134. Its totient is φ = 315450031132.
The previous prime is 315450031121. The next prime is 315450031157. The reversal of 315450031133 is 331130054513.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 315442859449 + 7171684 = 561643^2 + 2678^2 .
It is a cyclic number.
It is not a de Polignac number, because 315450031133 - 26 = 315450031069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 315450031096 and 315450031105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (315450031103) 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, 157725015566 + 157725015567.
It is an arithmetic number, because the mean of its divisors is an integer number (157725015567).
Almost surely, 2315450031133 is an apocalyptic number.
It is an amenable number.
315450031133 is a deficient number, since it is larger than the sum of its proper divisors (1).
315450031133 is an equidigital number, since it uses as much as digits as its factorization.
315450031133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 29.
Adding to 315450031133 its reverse (331130054513), we get a palindrome (646580085646).
The spelling of 315450031133 in words is "three hundred fifteen billion, four hundred fifty million, thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •