Base | Representation |
---|---|
bin | 100011110101110010001101… |
… | …1001110101010101110100101 |
3 | 1112100020010011110212020002201 |
4 | 1013223210123032222232211 |
5 | 312310120424414323212 |
6 | 3034254150430534501 |
7 | 123255306331262641 |
oct | 10753443316525645 |
9 | 1470203143766081 |
10 | 315255351323557 |
11 | 914a505314a8a7 |
12 | 2b436723367431 |
13 | 106ba5b526c808 |
14 | 57bc624713c21 |
15 | 266a7ad9deb57 |
hex | 11eb91b3aaba5 |
315255351323557 has 2 divisors, whose sum is σ = 315255351323558. Its totient is φ = 315255351323556.
The previous prime is 315255351323491. The next prime is 315255351323593. The reversal of 315255351323557 is 755323153552513.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 236568977878401 + 78686373445156 = 15380799^2 + 8870534^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-315255351323557 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 315255351323498 and 315255351323507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (315255351323357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157627675661778 + 157627675661779.
It is an arithmetic number, because the mean of its divisors is an integer number (157627675661779).
Almost surely, 2315255351323557 is an apocalyptic number.
It is an amenable number.
315255351323557 is a deficient number, since it is larger than the sum of its proper divisors (1).
315255351323557 is an equidigital number, since it uses as much as digits as its factorization.
315255351323557 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 35437500, while the sum is 55.
The spelling of 315255351323557 in words is "three hundred fifteen trillion, two hundred fifty-five billion, three hundred fifty-one million, three hundred twenty-three thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •