Base | Representation |
---|---|
bin | 10010110010001… |
… | …011000010011101 |
3 | 210221222212222002 |
4 | 102302023002131 |
5 | 1121134023201 |
6 | 51134332045 |
7 | 10544444135 |
oct | 2262130235 |
9 | 727885862 |
10 | 315142301 |
11 | 151987091 |
12 | 8965a025 |
13 | 503a0146 |
14 | 2dbd5ac5 |
15 | 1ca0076b |
hex | 12c8b09d |
315142301 has 4 divisors (see below), whose sum is σ = 317257500. Its totient is φ = 313027104.
The previous prime is 315142273. The next prime is 315142307. The reversal of 315142301 is 103241513.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 48636676 + 266505625 = 6974^2 + 16325^2 .
It is a cyclic number.
It is not a de Polignac number, because 315142301 - 26 = 315142237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (315142307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1057376 + ... + 1057673.
It is an arithmetic number, because the mean of its divisors is an integer number (79314375).
Almost surely, 2315142301 is an apocalyptic number.
It is an amenable number.
315142301 is a deficient number, since it is larger than the sum of its proper divisors (2115199).
315142301 is a wasteful number, since it uses less digits than its factorization.
315142301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2115198.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 315142301 is about 17752.2477731695. The cubic root of 315142301 is about 680.5116542779.
Adding to 315142301 its reverse (103241513), we get a palindrome (418383814).
The spelling of 315142301 in words is "three hundred fifteen million, one hundred forty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •