Base | Representation |
---|---|
bin | 10111111110000111… |
… | …00010001111110101 |
3 | 1020012212101112201122 |
4 | 23333003202033311 |
5 | 202323434121011 |
6 | 5524552233325 |
7 | 633623063144 |
oct | 137703421765 |
9 | 36185345648 |
10 | 12869051381 |
11 | 550427585a |
12 | 25b199b845 |
13 | 12a1213504 |
14 | 8a11dd75b |
15 | 504bd73db |
hex | 2ff0e23f5 |
12869051381 has 4 divisors (see below), whose sum is σ = 12870770892. Its totient is φ = 12867331872.
The previous prime is 12869051369. The next prime is 12869051431. The reversal of 12869051381 is 18315096821.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 18315096821 = 7 ⋅2616442403.
It can be written as a sum of positive squares in 2 ways, for example, as 9763218481 + 3105832900 = 98809^2 + 55730^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12869051381 is a prime.
It is a super-2 number, since 2×128690513812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12869051081) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 848480 + ... + 863513.
It is an arithmetic number, because the mean of its divisors is an integer number (3217692723).
Almost surely, 212869051381 is an apocalyptic number.
It is an amenable number.
12869051381 is a deficient number, since it is larger than the sum of its proper divisors (1719511).
12869051381 is an equidigital number, since it uses as much as digits as its factorization.
12869051381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1719510.
The product of its (nonzero) digits is 103680, while the sum is 44.
The spelling of 12869051381 in words is "twelve billion, eight hundred sixty-nine million, fifty-one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.216 sec. • engine limits •