Base | Representation |
---|---|
bin | 111111100011000… |
… | …0101010110011001 |
3 | 12111121022010100212 |
4 | 1333012011112121 |
5 | 13331332114314 |
6 | 551330340505 |
7 | 103561155413 |
oct | 17706052631 |
9 | 5447263325 |
10 | 2132301209 |
11 | 9a46a0505 |
12 | 4b612a735 |
13 | 27c9ba3bc |
14 | 1632979b3 |
15 | c72e7e3e |
hex | 7f185599 |
2132301209 has 4 divisors (see below), whose sum is σ = 2132597940. Its totient is φ = 2132004480.
The previous prime is 2132301191. The next prime is 2132301233. The reversal of 2132301209 is 9021032312.
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 2007308809 + 124992400 = 44803^2 + 11180^2 .
It is a cyclic number.
It is not a de Polignac number, because 2132301209 - 216 = 2132235673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2132331209) 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, 137312 + ... + 152049.
It is an arithmetic number, because the mean of its divisors is an integer number (533149485).
Almost surely, 22132301209 is an apocalyptic number.
It is an amenable number.
2132301209 is a deficient number, since it is larger than the sum of its proper divisors (296731).
2132301209 is an equidigital number, since it uses as much as digits as its factorization.
2132301209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296730.
The product of its (nonzero) digits is 648, while the sum is 23.
The square root of 2132301209 is about 46176.8471097800. The cubic root of 2132301209 is about 1287.1115407582. Note that the first 3 decimals are identical.
The spelling of 2132301209 in words is "two billion, one hundred thirty-two million, three hundred one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •