Base | Representation |
---|---|
bin | 111011111110000… |
… | …0001011101001111 |
3 | 12012020100112110022 |
4 | 1313330001131033 |
5 | 13110112121221 |
6 | 531400532355 |
7 | 100602421160 |
oct | 16774013517 |
9 | 5166315408 |
10 | 2012223311 |
11 | 94293617a |
12 | 481a810bb |
13 | 260b66ba7 |
14 | 15135b767 |
15 | bb9c94ab |
hex | 77f0174f |
2012223311 has 8 divisors (see below), whose sum is σ = 2304998304. Its totient is φ = 1720776960.
The previous prime is 2012223307. The next prime is 2012223331. The reversal of 2012223311 is 1133222102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2012223311 - 22 = 2012223307 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2012223311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012223331) 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 7 ways as a sum of consecutive naturals, for example, 328910 + ... + 334971.
It is an arithmetic number, because the mean of its divisors is an integer number (288124788).
Almost surely, 22012223311 is an apocalyptic number.
2012223311 is a deficient number, since it is larger than the sum of its proper divisors (292774993).
2012223311 is an equidigital number, since it uses as much as digits as its factorization.
2012223311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 664321.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2012223311 is about 44857.8121512853. The cubic root of 2012223311 is about 1262.4825730496.
Adding to 2012223311 its reverse (1133222102), we get a palindrome (3145445413).
The spelling of 2012223311 in words is "two billion, twelve million, two hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •