Base | Representation |
---|---|
bin | 10111110010100100… |
… | …11010101001110101 |
3 | 1012222010022111212222 |
4 | 23321102122221311 |
5 | 202124201223031 |
6 | 5511214252125 |
7 | 631336444403 |
oct | 137122325165 |
9 | 35863274788 |
10 | 12772289141 |
11 | 5464695967 |
12 | 25854b7045 |
13 | 1287164651 |
14 | 892412473 |
15 | 4eb471e7b |
hex | 2f949aa75 |
12772289141 has 4 divisors (see below), whose sum is σ = 12773503212. Its totient is φ = 12771075072.
The previous prime is 12772289099. The next prime is 12772289147. The reversal of 12772289141 is 14198227721.
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 8774256241 + 3998032900 = 93671^2 + 63230^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12772289141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12772289092 and 12772289101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12772289147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 591116 + ... + 612341.
It is an arithmetic number, because the mean of its divisors is an integer number (3193375803).
Almost surely, 212772289141 is an apocalyptic number.
It is an amenable number.
12772289141 is a deficient number, since it is larger than the sum of its proper divisors (1214071).
12772289141 is a wasteful number, since it uses less digits than its factorization.
12772289141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1214070.
The product of its digits is 112896, while the sum is 44.
The spelling of 12772289141 in words is "twelve billion, seven hundred seventy-two million, two hundred eighty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •