Base | Representation |
---|---|
bin | 1001001010111111100… |
… | …11110110101100101001 |
3 | 1010010102122120211021101 |
4 | 10211133303312230221 |
5 | 20130401322312023 |
6 | 400435012441401 |
7 | 31524315104143 |
oct | 4453763665451 |
9 | 1103378524241 |
10 | 315140041513 |
11 | 111717379600 |
12 | 510ab919261 |
13 | 2394369ab5b |
14 | 11377bbbc93 |
15 | 82e69371ad |
hex | 495fcf6b29 |
315140041513 has 12 divisors (see below), whose sum is σ = 346422683124. Its totient is φ = 286466892800.
The previous prime is 315140041493. The next prime is 315140041519.
315140041513 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 109430624809 + 205709416704 = 330803^2 + 453552^2 .
It is not a de Polignac number, because 315140041513 - 25 = 315140041481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (315140041519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1426545 + ... + 1632577.
It is an arithmetic number, because the mean of its divisors is an integer number (28868556927).
Almost surely, 2315140041513 is an apocalyptic number.
It is an amenable number.
315140041513 is a deficient number, since it is larger than the sum of its proper divisors (31282641611).
315140041513 is a wasteful number, since it uses less digits than its factorization.
315140041513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218696 (or 218685 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 28.
It can be divided in two parts, 3151400 and 41513, that added together give a palindrome (3192913).
The spelling of 315140041513 in words is "three hundred fifteen billion, one hundred forty million, forty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •