Base | Representation |
---|---|
bin | 10111101100100111… |
… | …01000011001111001 |
3 | 1012211122012120200222 |
4 | 23312103220121321 |
5 | 202023400312321 |
6 | 5502230305425 |
7 | 630161363363 |
oct | 136623503171 |
9 | 35748176628 |
10 | 12722275961 |
11 | 543943625a |
12 | 25707b8275 |
13 | 12799a3255 |
14 | 889913d33 |
15 | 4e6d933ab |
hex | 2f64e8679 |
12722275961 has 4 divisors (see below), whose sum is σ = 12930837924. Its totient is φ = 12513714000.
The previous prime is 12722275921. The next prime is 12722275967. The reversal of 12722275961 is 16957222721.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16957222721 = 1009 ⋅16805969.
It can be written as a sum of positive squares in 2 ways, for example, as 529920400 + 12192355561 = 23020^2 + 110419^2 .
It is a cyclic number.
It is not a de Polignac number, because 12722275961 - 26 = 12722275897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12722275967) 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, 104280890 + ... + 104281011.
It is an arithmetic number, because the mean of its divisors is an integer number (3232709481).
Almost surely, 212722275961 is an apocalyptic number.
It is an amenable number.
12722275961 is a deficient number, since it is larger than the sum of its proper divisors (208561963).
12722275961 is an equidigital number, since it uses as much as digits as its factorization.
12722275961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208561962.
The product of its digits is 211680, while the sum is 44.
The spelling of 12722275961 in words is "twelve billion, seven hundred twenty-two million, two hundred seventy-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •