Base | Representation |
---|---|
bin | 1000010011110000… |
… | …0000000000111011 |
3 | 12202102202001112022 |
4 | 2010330000000323 |
5 | 14031430234321 |
6 | 1005151305055 |
7 | 106161263126 |
oct | 20474000073 |
9 | 5672661468 |
10 | 2230321211 |
11 | a44a5a378 |
12 | 522b1b18b |
13 | 2970b98c1 |
14 | 1722d13bd |
15 | d0c0adab |
hex | 84f0003b |
2230321211 has 4 divisors (see below), whose sum is σ = 2233038624. Its totient is φ = 2227603800.
The previous prime is 2230321199. The next prime is 2230321253. The reversal of 2230321211 is 1121230322.
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 2230321211 - 218 = 2230059067 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 2230321211.
It is not an unprimeable number, because it can be changed into a prime (2230321271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1357475 + ... + 1359116.
It is an arithmetic number, because the mean of its divisors is an integer number (558259656).
Almost surely, 22230321211 is an apocalyptic number.
2230321211 is a deficient number, since it is larger than the sum of its proper divisors (2717413).
2230321211 is an equidigital number, since it uses as much as digits as its factorization.
2230321211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2717412.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2230321211 is about 47226.2767005827. The cubic root of 2230321211 is about 1306.5392818068.
Adding to 2230321211 its reverse (1121230322), we get a palindrome (3351551533).
The spelling of 2230321211 in words is "two billion, two hundred thirty million, three hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •