Base | Representation |
---|---|
bin | 1001001010110010110… |
… | …00101011101010010101 |
3 | 1010010011010202201010221 |
4 | 10211121120223222111 |
5 | 20130141224131000 |
6 | 400420202314341 |
7 | 31521535662130 |
oct | 4453130535225 |
9 | 1103133681127 |
10 | 315032255125 |
11 | 11167154a045 |
12 | 5107b7b89b1 |
13 | 2392725c223 |
14 | 11367761217 |
15 | 82dc24561a |
hex | 495962ba95 |
315032255125 has 128 divisors (see below), whose sum is σ = 481971409920. Its totient is φ = 200678400000.
The previous prime is 315032254997. The next prime is 315032255129. The reversal of 315032255125 is 521552230513.
It is not a de Polignac number, because 315032255125 - 27 = 315032254997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (315032255129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 524179825 + ... + 524180425.
It is an arithmetic number, because the mean of its divisors is an integer number (3765401640).
Almost surely, 2315032255125 is an apocalyptic number.
315032255125 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
315032255125 is a deficient number, since it is larger than the sum of its proper divisors (166939154795).
315032255125 is a wasteful number, since it uses less digits than its factorization.
315032255125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1040 (or 1030 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 34.
Adding to 315032255125 its reverse (521552230513), we get a palindrome (836584485638).
The spelling of 315032255125 in words is "three hundred fifteen billion, thirty-two million, two hundred fifty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •