Base | Representation |
---|---|
bin | 1011011010011100000101… |
… | …0001000111001110010001 |
3 | 1122102122202101001110212221 |
4 | 2312213001101013032101 |
5 | 3121100012020212322 |
6 | 42404505230021041 |
7 | 2433424000500604 |
oct | 266470121071621 |
9 | 48378671043787 |
10 | 12548841960337 |
11 | 3aa8a30158a81 |
12 | 14a8071947781 |
13 | 7004736b7ab7 |
14 | 31551d80633b |
15 | 16b6568ea9c7 |
hex | b69c1447391 |
12548841960337 has 2 divisors, whose sum is σ = 12548841960338. Its totient is φ = 12548841960336.
The previous prime is 12548841960293. The next prime is 12548841960341. The reversal of 12548841960337 is 73306914884521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11536647006096 + 1012194954241 = 3396564^2 + 1006079^2 .
It is a cyclic number.
It is not a de Polignac number, because 12548841960337 - 215 = 12548841927569 is a prime.
It is a super-2 number, since 2×125488419603372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12548841960437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6274420980168 + 6274420980169.
It is an arithmetic number, because the mean of its divisors is an integer number (6274420980169).
It is a 1-persistent number, because it is pandigital, but 2⋅12548841960337 = 25097683920674 is not.
Almost surely, 212548841960337 is an apocalyptic number.
It is an amenable number.
12548841960337 is a deficient number, since it is larger than the sum of its proper divisors (1).
12548841960337 is an equidigital number, since it uses as much as digits as its factorization.
12548841960337 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34836480, while the sum is 61.
The spelling of 12548841960337 in words is "twelve trillion, five hundred forty-eight billion, eight hundred forty-one million, nine hundred sixty thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •