Base | Representation |
---|---|
bin | 1101111101000010111100… |
… | …1001111000001111011001 |
3 | 2000022201110020021002122011 |
4 | 3133100233021320033121 |
5 | 4002332231030100441 |
6 | 52344112520225521 |
7 | 3142311220545556 |
oct | 337205711701731 |
9 | 60281406232564 |
10 | 15342414300121 |
11 | 4985754995277 |
12 | 187956760b2a1 |
13 | 873a2535549c |
14 | 3b0810ac7a2d |
15 | 1b9158758581 |
hex | df42f2783d9 |
15342414300121 has 2 divisors, whose sum is σ = 15342414300122. Its totient is φ = 15342414300120.
The previous prime is 15342414300047. The next prime is 15342414300131. The reversal of 15342414300121 is 12100341424351.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13359105410121 + 1983308890000 = 3655011^2 + 1408300^2 .
It is a cyclic number.
It is not a de Polignac number, because 15342414300121 - 29 = 15342414299609 is a prime.
It is a super-2 number, since 2×153424143001212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (15342414300131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7671207150060 + 7671207150061.
It is an arithmetic number, because the mean of its divisors is an integer number (7671207150061).
Almost surely, 215342414300121 is an apocalyptic number.
It is an amenable number.
15342414300121 is a deficient number, since it is larger than the sum of its proper divisors (1).
15342414300121 is an equidigital number, since it uses as much as digits as its factorization.
15342414300121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 15342414300121 its reverse (12100341424351), we get a palindrome (27442755724472).
The spelling of 15342414300121 in words is "fifteen trillion, three hundred forty-two billion, four hundred fourteen million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •