Base | Representation |
---|---|
bin | 1000100100011010… |
… | …0111001111110011 |
3 | 12221022020212221212 |
4 | 2021012213033303 |
5 | 14202323242321 |
6 | 1020125310335 |
7 | 111000324023 |
oct | 21106471763 |
9 | 5838225855 |
10 | 2300212211 |
11 | a80456530 |
12 | 5424053ab |
13 | 2a871a91b |
14 | 17b6c5a83 |
15 | d6e1455b |
hex | 891a73f3 |
2300212211 has 8 divisors (see below), whose sum is σ = 2510044848. Its totient is φ = 2090500000.
The previous prime is 2300212199. The next prime is 2300212249. The reversal of 2300212211 is 1122120032.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2300212211 - 26 = 2300212147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2300242211) 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 7 ways as a sum of consecutive naturals, for example, 12461 + ... + 68961.
It is an arithmetic number, because the mean of its divisors is an integer number (313755606).
Almost surely, 22300212211 is an apocalyptic number.
2300212211 is a deficient number, since it is larger than the sum of its proper divisors (209832637).
2300212211 is a wasteful number, since it uses less digits than its factorization.
2300212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60213.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2300212211 is about 47960.5276347123. The cubic root of 2300212211 is about 1320.0467176226.
Adding to 2300212211 its reverse (1122120032), we get a palindrome (3422332243).
It can be divided in two parts, 230021 and 2211, that added together give a palindrome (232232).
The spelling of 2300212211 in words is "two billion, three hundred million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •