Base | Representation |
---|---|
bin | 100011110100110011010111… |
… | …1100110011000110100001111 |
3 | 1112022202012211121011210101002 |
4 | 1013221212233212120310033 |
5 | 312300413040303204033 |
6 | 3034112151454210515 |
7 | 123242461212554504 |
oct | 10751465746306417 |
9 | 1468665747153332 |
10 | 315120401616143 |
11 | 914528a25a4292 |
12 | 2b414540ab3a3b |
13 | 106aa959a97a36 |
14 | 57b5ca1b194ab |
15 | 266701135b3e8 |
hex | 11e99af998d0f |
315120401616143 has 16 divisors (see below), whose sum is σ = 317529135920640. Its totient is φ = 312713708269536.
The previous prime is 315120401616133. The next prime is 315120401616149. The reversal of 315120401616143 is 341616104021513.
It is a cyclic number.
It is not a de Polignac number, because 315120401616143 - 24 = 315120401616127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 315120401616097 and 315120401616106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (315120401616149) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9894806246 + ... + 9894838092.
It is an arithmetic number, because the mean of its divisors is an integer number (19845570995040).
Almost surely, 2315120401616143 is an apocalyptic number.
315120401616143 is a deficient number, since it is larger than the sum of its proper divisors (2408734304497).
315120401616143 is a wasteful number, since it uses less digits than its factorization.
315120401616143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61526.
The product of its (nonzero) digits is 51840, while the sum is 38.
Adding to 315120401616143 its reverse (341616104021513), we get a palindrome (656736505637656).
The spelling of 315120401616143 in words is "three hundred fifteen trillion, one hundred twenty billion, four hundred one million, six hundred sixteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •