Base | Representation |
---|---|
bin | 1011101110001111110010… |
… | …1100110101110101010001 |
3 | 1200122012010102200022000222 |
4 | 2323203330230311311101 |
5 | 3142133430211020030 |
6 | 43225105002122425 |
7 | 2500131641042231 |
oct | 273437454656521 |
9 | 50565112608028 |
10 | 12889141501265 |
11 | 411a2883a38a7 |
12 | 15420034b0415 |
13 | 726596665ac3 |
14 | 327ba2c09cc1 |
15 | 17542200e3e5 |
hex | bb8fcb35d51 |
12889141501265 has 4 divisors (see below), whose sum is σ = 15466969801524. Its totient is φ = 10311313201008.
The previous prime is 12889141501241. The next prime is 12889141501309. The reversal of 12889141501265 is 56210514198821.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3291463149121 + 9597678352144 = 1814239^2 + 3098012^2 .
It is a cyclic number.
It is not a de Polignac number, because 12889141501265 - 220 = 12889140452689 is a prime.
It is a super-2 number, since 2×128891415012652 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1288914150122 + ... + 1288914150131.
It is an arithmetic number, because the mean of its divisors is an integer number (3866742450381).
Almost surely, 212889141501265 is an apocalyptic number.
It is an amenable number.
12889141501265 is a deficient number, since it is larger than the sum of its proper divisors (2577828300259).
12889141501265 is an equidigital number, since it uses as much as digits as its factorization.
12889141501265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2577828300258.
The product of its (nonzero) digits is 1382400, while the sum is 53.
The spelling of 12889141501265 in words is "twelve trillion, eight hundred eighty-nine billion, one hundred forty-one million, five hundred one thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •