Base | Representation |
---|---|
bin | 10110010110100000… |
… | …10111100011010011 |
3 | 1010222022010011122021 |
4 | 23023100113203103 |
5 | 144034000001321 |
6 | 5302425352311 |
7 | 603241214233 |
oct | 131320274323 |
9 | 33868104567 |
10 | 12000000211 |
11 | 50a8761851 |
12 | 23aa938697 |
13 | 1193164954 |
14 | 81ba1bcc3 |
15 | 4a3770941 |
hex | 2cb4178d3 |
12000000211 has 8 divisors (see below), whose sum is σ = 12393567104. Its totient is φ = 11606837760.
The previous prime is 12000000169. The next prime is 12000000293. The reversal of 12000000211 is 11200000021.
12000000211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12000000211 - 221 = 11997903059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12000000194 and 12000000203.
It is not an unprimeable number, because it can be changed into a prime (12000000911) 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, 40206 + ... + 160051.
It is an arithmetic number, because the mean of its divisors is an integer number (1549195888).
Almost surely, 212000000211 is an apocalyptic number.
12000000211 is a deficient number, since it is larger than the sum of its proper divisors (393566893).
12000000211 is a wasteful number, since it uses less digits than its factorization.
12000000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202221.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 12000000211 its reverse (11200000021), we get a palindrome (23200000232).
The spelling of 12000000211 in words is "twelve billion, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •