Base | Representation |
---|---|
bin | 101011110101010101000… |
… | …111000110101011010011 |
3 | 101122222000101201111111210 |
4 | 223311111013012223103 |
5 | 343322441200001321 |
6 | 10223441403511203 |
7 | 430424060355603 |
oct | 53652507065323 |
9 | 11588011644453 |
10 | 3012200000211 |
11 | a61515410486 |
12 | 40794b828503 |
13 | 18b08424bb3c |
14 | a5b112d6c03 |
15 | 5354a81db76 |
hex | 2bd551c6ad3 |
3012200000211 has 4 divisors (see below), whose sum is σ = 4016266666952. Its totient is φ = 2008133333472.
The previous prime is 3012200000143. The next prime is 3012200000213. The reversal of 3012200000211 is 1120000022103.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 3012200000211 - 221 = 3012197903059 is a prime.
It is a super-2 number, since 2×30122000002112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3012200000213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 502033333366 + ... + 502033333371.
It is an arithmetic number, because the mean of its divisors is an integer number (1004066666738).
Almost surely, 23012200000211 is an apocalyptic number.
3012200000211 is a deficient number, since it is larger than the sum of its proper divisors (1004066666741).
3012200000211 is a wasteful number, since it uses less digits than its factorization.
3012200000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004066666740.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 3012200000211 its reverse (1120000022103), we get a palindrome (4132200022314).
The spelling of 3012200000211 in words is "three trillion, twelve billion, two hundred million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •