Base | Representation |
---|---|
bin | 1011100000001110110001… |
… | …1100101011101011000111 |
3 | 1122210011121022020020120201 |
4 | 2320003230130223223013 |
5 | 3124212310232130234 |
6 | 42522323322511331 |
7 | 2443545630501502 |
oct | 270035434535307 |
9 | 48704538206521 |
10 | 12648350661319 |
11 | 403715422a92a |
12 | 1503403065547 |
13 | 70997149a959 |
14 | 31a27d4d8139 |
15 | 16e02c93a314 |
hex | b80ec72bac7 |
12648350661319 has 2 divisors, whose sum is σ = 12648350661320. Its totient is φ = 12648350661318.
The previous prime is 12648350661293. The next prime is 12648350661337. The reversal of 12648350661319 is 91316605384621.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12648350661319 - 239 = 12098594847431 is a prime.
It is a super-2 number, since 2×126483506613192 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12648350661319.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12648350661019) 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, 6324175330659 + 6324175330660.
It is an arithmetic number, because the mean of its divisors is an integer number (6324175330660).
Almost surely, 212648350661319 is an apocalyptic number.
12648350661319 is a deficient number, since it is larger than the sum of its proper divisors (1).
12648350661319 is an equidigital number, since it uses as much as digits as its factorization.
12648350661319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5598720, while the sum is 55.
The spelling of 12648350661319 in words is "twelve trillion, six hundred forty-eight billion, three hundred fifty million, six hundred sixty-one thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •