Base | Representation |
---|---|
bin | 1101110000110001011000… |
… | …1110001101000100100001 |
3 | 1222120120011012222010122010 |
4 | 3130030112032031010201 |
5 | 3440403344401343423 |
6 | 52103200144103133 |
7 | 3121134505662633 |
oct | 334142616150441 |
9 | 58516135863563 |
10 | 15131542606113 |
11 | 490428436049a |
12 | 1844717004aa9 |
13 | 859b8a88339b |
14 | 3a4528bb4a53 |
15 | 1b3915b3b693 |
hex | dc31638d121 |
15131542606113 has 32 divisors (see below), whose sum is σ = 20285978440320. Its totient is φ = 10032566469120.
The previous prime is 15131542606109. The next prime is 15131542606177. The reversal of 15131542606113 is 31160624513151.
It is not a de Polignac number, because 15131542606113 - 22 = 15131542606109 is a prime.
It is a super-2 number, since 2×151315426061132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (15131542606183) 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 31 ways as a sum of consecutive naturals, for example, 1262955583 + ... + 1262967563.
It is an arithmetic number, because the mean of its divisors is an integer number (633936826260).
Almost surely, 215131542606113 is an apocalyptic number.
It is an amenable number.
15131542606113 is a deficient number, since it is larger than the sum of its proper divisors (5154435834207).
15131542606113 is a wasteful number, since it uses less digits than its factorization.
15131542606113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15249.
The product of its (nonzero) digits is 64800, while the sum is 39.
The spelling of 15131542606113 in words is "fifteen trillion, one hundred thirty-one billion, five hundred forty-two million, six hundred six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •