Base | Representation |
---|---|
bin | 1011011000010111100010… |
… | …1001000000110101011001 |
3 | 1122022020220212101011011002 |
4 | 2312011320221000311121 |
5 | 3120004131010003424 |
6 | 42340303005314345 |
7 | 2431024224631355 |
oct | 266057051006531 |
9 | 48266825334132 |
10 | 12513263750489 |
11 | 3a94933192367 |
12 | 14a11a28659b5 |
13 | 6c9cc3757718 |
14 | 3139065c6465 |
15 | 16a773203cae |
hex | b6178a40d59 |
12513263750489 has 2 divisors, whose sum is σ = 12513263750490. Its totient is φ = 12513263750488.
The previous prime is 12513263750467. The next prime is 12513263750509. The reversal of 12513263750489 is 98405736231521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6532793500489 + 5980470250000 = 2555933^2 + 2445500^2 .
It is a cyclic number.
It is not a de Polignac number, because 12513263750489 - 212 = 12513263746393 is a prime.
It is a super-3 number, since 3×125132637504893 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (12513263750419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6256631875244 + 6256631875245.
It is an arithmetic number, because the mean of its divisors is an integer number (6256631875245).
It is a 1-persistent number, because it is pandigital, but 2⋅12513263750489 = 25026527500978 is not.
Almost surely, 212513263750489 is an apocalyptic number.
It is an amenable number.
12513263750489 is a deficient number, since it is larger than the sum of its proper divisors (1).
12513263750489 is an equidigital number, since it uses as much as digits as its factorization.
12513263750489 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10886400, while the sum is 56.
The spelling of 12513263750489 in words is "twelve trillion, five hundred thirteen billion, two hundred sixty-three million, seven hundred fifty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •