Base | Representation |
---|---|
bin | 1101111010100110011110… |
… | …1100000001100100000101 |
3 | 2000011201001002121011212101 |
4 | 3132221213230001210011 |
5 | 4001140221223233331 |
6 | 52312525052552101 |
7 | 3136263333344113 |
oct | 336514754014405 |
9 | 60151032534771 |
10 | 15300413102341 |
11 | 4969961351774 |
12 | 18713a5482631 |
13 | 86ca907c9633 |
14 | 3ac78882cab3 |
15 | 1b7eeb224061 |
hex | dea67b01905 |
15300413102341 has 2 divisors, whose sum is σ = 15300413102342. Its totient is φ = 15300413102340.
The previous prime is 15300413102297. The next prime is 15300413102389. The reversal of 15300413102341 is 14320131400351.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7883342137441 + 7417070964900 = 2807729^2 + 2723430^2 .
It is a cyclic number.
It is not a de Polignac number, because 15300413102341 - 211 = 15300413100293 is a prime.
It is a super-2 number, since 2×153004131023412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15300413102441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7650206551170 + 7650206551171.
It is an arithmetic number, because the mean of its divisors is an integer number (7650206551171).
Almost surely, 215300413102341 is an apocalyptic number.
It is an amenable number.
15300413102341 is a deficient number, since it is larger than the sum of its proper divisors (1).
15300413102341 is an equidigital number, since it uses as much as digits as its factorization.
15300413102341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 15300413102341 its reverse (14320131400351), we get a palindrome (29620544502692).
The spelling of 15300413102341 in words is "fifteen trillion, three hundred billion, four hundred thirteen million, one hundred two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •