Base | Representation |
---|---|
bin | 1011000110110010010001… |
… | …0011000100001100010001 |
3 | 1121020101020121000112222110 |
4 | 2301230210103010030101 |
5 | 3100032014424001314 |
6 | 41545425344255533 |
7 | 2400141641623551 |
oct | 261544423041421 |
9 | 47211217015873 |
10 | 12211201000209 |
11 | 398881768a272 |
12 | 14527426115a9 |
13 | 6a7685480a23 |
14 | 30304d533161 |
15 | 1629948d9a59 |
hex | b1b244c4311 |
12211201000209 has 8 divisors (see below), whose sum is σ = 16320274972672. Its totient is φ = 8121463847280.
The previous prime is 12211201000189. The next prime is 12211201000223. The reversal of 12211201000209 is 90200010211221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12211201000209 - 27 = 12211201000081 is a prime.
It is a super-2 number, since 2×122112010002092 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12211201000109) 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, 4834203409 + ... + 4834205934.
It is an arithmetic number, because the mean of its divisors is an integer number (2040034371584).
Almost surely, 212211201000209 is an apocalyptic number.
It is an amenable number.
12211201000209 is a deficient number, since it is larger than the sum of its proper divisors (4109073972463).
12211201000209 is an equidigital number, since it uses as much as digits as its factorization.
12211201000209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9668409767.
The product of its (nonzero) digits is 144, while the sum is 21.
The spelling of 12211201000209 in words is "twelve trillion, two hundred eleven billion, two hundred one million, two hundred nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •