Base | Representation |
---|---|
bin | 1101110000110000100001… |
… | …1011010001101111100111 |
3 | 1222120112120002110001102101 |
4 | 3130030020123101233213 |
5 | 3440402411123331403 |
6 | 52103121155152531 |
7 | 3121125665442616 |
oct | 334141033215747 |
9 | 58515502401371 |
10 | 15131311152103 |
11 | 4904175744693 |
12 | 18446715a5747 |
13 | 859b51935353 |
14 | 3a450616587d |
15 | 1b390066c71d |
hex | dc3086d1be7 |
15131311152103 has 2 divisors, whose sum is σ = 15131311152104. Its totient is φ = 15131311152102.
The previous prime is 15131311152091. The next prime is 15131311152107. The reversal of 15131311152103 is 30125111313151.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 15131311152103 - 213 = 15131311143911 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15131311152107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7565655576051 + 7565655576052.
It is an arithmetic number, because the mean of its divisors is an integer number (7565655576052).
Almost surely, 215131311152103 is an apocalyptic number.
15131311152103 is a deficient number, since it is larger than the sum of its proper divisors (1).
15131311152103 is an equidigital number, since it uses as much as digits as its factorization.
15131311152103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 28.
Adding to 15131311152103 its reverse (30125111313151), we get a palindrome (45256422465254).
The spelling of 15131311152103 in words is "fifteen trillion, one hundred thirty-one billion, three hundred eleven million, one hundred fifty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •