Base | Representation |
---|---|
bin | 111110101011100… |
… | …1100011011010011 |
3 | 12102120121021012022 |
4 | 1331113030123103 |
5 | 13301411412321 |
6 | 544411322055 |
7 | 103056115223 |
oct | 17527143323 |
9 | 5376537168 |
10 | 2103232211 |
11 | 98a246543 |
12 | 4a845032b |
13 | 276980102 |
14 | 15d48c083 |
15 | c49a4dab |
hex | 7d5cc6d3 |
2103232211 has 4 divisors (see below), whose sum is σ = 2152144632. Its totient is φ = 2054319792.
The previous prime is 2103232199. The next prime is 2103232277. The reversal of 2103232211 is 1122323012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2103232211 - 210 = 2103231187 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2103232211.
It is not an unprimeable number, because it can be changed into a prime (2103232811) 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, 24456146 + ... + 24456231.
It is an arithmetic number, because the mean of its divisors is an integer number (538036158).
Almost surely, 22103232211 is an apocalyptic number.
2103232211 is a deficient number, since it is larger than the sum of its proper divisors (48912421).
2103232211 is an equidigital number, since it uses as much as digits as its factorization.
2103232211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48912420.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2103232211 is about 45861.0097032327. The cubic root of 2103232211 is about 1281.2358285294.
Adding to 2103232211 its reverse (1122323012), we get a palindrome (3225555223).
The spelling of 2103232211 in words is "two billion, one hundred three million, two hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •