Base | Representation |
---|---|
bin | 11000001001001001… |
… | …00100100000111101 |
3 | 1020110022112101010201 |
4 | 30010210210200331 |
5 | 203021132110001 |
6 | 5542100003501 |
7 | 636125521666 |
oct | 140444444075 |
9 | 36408471121 |
10 | 12961597501 |
11 | 5551536056 |
12 | 2618990591 |
13 | 12b7447328 |
14 | 8ad61036d |
15 | 50cdb8501 |
hex | 30492483d |
12961597501 has 4 divisors (see below), whose sum is σ = 12962163100. Its totient is φ = 12961031904.
The previous prime is 12961597499. The next prime is 12961597511. The reversal of 12961597501 is 10579516921.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10579516921 = 173 ⋅61153277.
It can be written as a sum of positive squares in 2 ways, for example, as 11463984900 + 1497612601 = 107070^2 + 38699^2 .
It is a cyclic number.
It is not a de Polignac number, because 12961597501 - 21 = 12961597499 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12961597511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 246906 + ... + 294763.
It is an arithmetic number, because the mean of its divisors is an integer number (3240540775).
Almost surely, 212961597501 is an apocalyptic number.
It is an amenable number.
12961597501 is a deficient number, since it is larger than the sum of its proper divisors (565599).
12961597501 is an equidigital number, since it uses as much as digits as its factorization.
12961597501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565598.
The product of its (nonzero) digits is 170100, while the sum is 46.
The spelling of 12961597501 in words is "twelve billion, nine hundred sixty-one million, five hundred ninety-seven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •