Base | Representation |
---|---|
bin | 10110010111001000… |
… | …11001011001100101 |
3 | 1010222122222220220101 |
4 | 23023210121121211 |
5 | 144041321010121 |
6 | 5303134104101 |
7 | 603333642535 |
oct | 131344313145 |
9 | 33878886811 |
10 | 12005250661 |
11 | 5100718568 |
12 | 23b064b031 |
13 | 1194282721 |
14 | 81c5c74c5 |
15 | 4a3e5b491 |
hex | 2cb919665 |
12005250661 has 4 divisors (see below), whose sum is σ = 12010452300. Its totient is φ = 12000049024.
The previous prime is 12005250641. The next prime is 12005250701. The reversal of 12005250661 is 16605250021.
12005250661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 9249630625 + 2755620036 = 96175^2 + 52494^2 .
It is a cyclic number.
It is not a de Polignac number, because 12005250661 - 25 = 12005250629 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 (12005250641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2597356 + ... + 2601973.
It is an arithmetic number, because the mean of its divisors is an integer number (3002613075).
Almost surely, 212005250661 is an apocalyptic number.
It is an amenable number.
12005250661 is a deficient number, since it is larger than the sum of its proper divisors (5201639).
12005250661 is an equidigital number, since it uses as much as digits as its factorization.
12005250661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5201638.
The product of its (nonzero) digits is 3600, while the sum is 28.
The spelling of 12005250661 in words is "twelve billion, five million, two hundred fifty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •