Base | Representation |
---|---|
bin | 1001001011010111111… |
… | …10000101100000110111 |
3 | 1010010221212110112121211 |
4 | 10211223332011200313 |
5 | 20131311034101411 |
6 | 400511141222251 |
7 | 31532343125560 |
oct | 4455376054067 |
9 | 1103855415554 |
10 | 315344050231 |
11 | 11181154a351 |
12 | 51148101987 |
13 | 23976a29982 |
14 | 11396d25167 |
15 | 83097d4221 |
hex | 496bf85837 |
315344050231 has 8 divisors (see below), whose sum is σ = 360501681024. Its totient is φ = 270213539640.
The previous prime is 315344050223. The next prime is 315344050237. The reversal of 315344050231 is 132050443513.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 315344050231 - 23 = 315344050223 is a prime.
It is a super-2 number, since 2×3153440502312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 315344050193 and 315344050202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (315344050237) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6755125 + ... + 6801646.
It is an arithmetic number, because the mean of its divisors is an integer number (45062710128).
Almost surely, 2315344050231 is an apocalyptic number.
315344050231 is a deficient number, since it is larger than the sum of its proper divisors (45157630793).
315344050231 is a wasteful number, since it uses less digits than its factorization.
315344050231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13560101.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 315344050231 its reverse (132050443513), we get a palindrome (447394493744).
The spelling of 315344050231 in words is "three hundred fifteen billion, three hundred forty-four million, fifty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •