Base | Representation |
---|---|
bin | 1101110001011101001111… |
… | …1101100110111010101001 |
3 | 1222121200112201102110101101 |
4 | 3130113103331212322221 |
5 | 3441102002330024121 |
6 | 52112424313521401 |
7 | 3122032325001445 |
oct | 334272375467251 |
9 | 58550481373341 |
10 | 15143315861161 |
11 | 4909276022244 |
12 | 1846a61a13261 |
13 | 85b015a583a7 |
14 | 3a4d2464b825 |
15 | 1b3da451d491 |
hex | dc5d3f66ea9 |
15143315861161 has 2 divisors, whose sum is σ = 15143315861162. Its totient is φ = 15143315861160.
The previous prime is 15143315861159. The next prime is 15143315861207. The reversal of 15143315861161 is 16116851334151.
It is a happy number.
It is an a-pointer prime, because the next prime (15143315861207) can be obtained adding 15143315861161 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9222269638761 + 5921046222400 = 3036819^2 + 2433320^2 .
It is a cyclic number.
It is not a de Polignac number, because 15143315861161 - 21 = 15143315861159 is a prime.
Together with 15143315861159, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (15143315801161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7571657930580 + 7571657930581.
It is an arithmetic number, because the mean of its divisors is an integer number (7571657930581).
Almost surely, 215143315861161 is an apocalyptic number.
It is an amenable number.
15143315861161 is a deficient number, since it is larger than the sum of its proper divisors (1).
15143315861161 is an equidigital number, since it uses as much as digits as its factorization.
15143315861161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 259200, while the sum is 46.
The spelling of 15143315861161 in words is "fifteen trillion, one hundred forty-three billion, three hundred fifteen million, eight hundred sixty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •