Base | Representation |
---|---|
bin | 1001001010110010101… |
… | …00010111000011010011 |
3 | 1010010011001122010222012 |
4 | 10211121110113003103 |
5 | 20130140431402011 |
6 | 400420122133135 |
7 | 31521523233005 |
oct | 4453124270323 |
9 | 1103131563865 |
10 | 315031122131 |
11 | 111670945890 |
12 | 5107b3511ab |
13 | 23926c5360b |
14 | 11367548375 |
15 | 82dc0bea8b |
hex | 49595170d3 |
315031122131 has 8 divisors (see below), whose sum is σ = 343685246400. Its totient is φ = 286379486440.
The previous prime is 315031122083. The next prime is 315031122157. The reversal of 315031122131 is 131221130513.
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 315031122131 - 26 = 315031122067 is a prime.
It is a super-2 number, since 2×3150311221312 (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 = 315031122097 and 315031122106.
It is not an unprimeable number, because it can be changed into a prime (315031122631) 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, 352361 + ... + 868458.
It is an arithmetic number, because the mean of its divisors is an integer number (42960655800).
Almost surely, 2315031122131 is an apocalyptic number.
315031122131 is a deficient number, since it is larger than the sum of its proper divisors (28654124269).
315031122131 is a wasteful number, since it uses less digits than its factorization.
315031122131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1244289.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 315031122131 its reverse (131221130513), we get a palindrome (446252252644).
The spelling of 315031122131 in words is "three hundred fifteen billion, thirty-one million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •