Base | Representation |
---|---|
bin | 1101110101100010010111… |
… | …0101101000111101110001 |
3 | 1222212101110121222212110022 |
4 | 3131120211311220331301 |
5 | 3443224030144341344 |
6 | 52204535452413225 |
7 | 3130063312456202 |
oct | 335304565507561 |
9 | 58771417885408 |
10 | 15213408980849 |
11 | 4935a74836532 |
12 | 1858563a77215 |
13 | 864806577941 |
14 | 3a84937835a9 |
15 | 1b5b07dc50ee |
hex | dd625d68f71 |
15213408980849 has 2 divisors, whose sum is σ = 15213408980850. Its totient is φ = 15213408980848.
The previous prime is 15213408980831. The next prime is 15213408981073. The reversal of 15213408980849 is 94808980431251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13215638750224 + 1997770230625 = 3635332^2 + 1413425^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15213408980849 is a prime.
It is a super-3 number, since 3×152134089808493 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15213408980791 and 15213408980800.
It is not a weakly prime, because it can be changed into another prime (15213408950849) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7606704490424 + 7606704490425.
It is an arithmetic number, because the mean of its divisors is an integer number (7606704490425).
Almost surely, 215213408980849 is an apocalyptic number.
It is an amenable number.
15213408980849 is a deficient number, since it is larger than the sum of its proper divisors (1).
15213408980849 is an equidigital number, since it uses as much as digits as its factorization.
15213408980849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19906560, while the sum is 62.
The spelling of 15213408980849 in words is "fifteen trillion, two hundred thirteen billion, four hundred eight million, nine hundred eighty thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •