Base | Representation |
---|---|
bin | 1011000110110001100110… |
… | …0100011010111000010011 |
3 | 1121020100210001022121101212 |
4 | 2301230121210122320103 |
5 | 3100031132334001321 |
6 | 41545355434250335 |
7 | 2400134324635325 |
oct | 261543144327023 |
9 | 47210701277355 |
10 | 12211021000211 |
11 | 3988735017640 |
12 | 14526b22869ab |
13 | 6a76570a9b57 |
14 | 303033679615 |
15 | 162983bd155b |
hex | b1b1991ae13 |
12211021000211 has 8 divisors (see below), whose sum is σ = 13405961679024. Its totient is φ = 11030221631520.
The previous prime is 12211021000187. The next prime is 12211021000231. The reversal of 12211021000211 is 11200012011221.
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 12211021000211 - 26 = 12211021000147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12211021000231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3535325720 + ... + 3535329173.
It is an arithmetic number, because the mean of its divisors is an integer number (1675745209878).
Almost surely, 212211021000211 is an apocalyptic number.
12211021000211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12211021000211 is a deficient number, since it is larger than the sum of its proper divisors (1194940678813).
12211021000211 is a wasteful number, since it uses less digits than its factorization.
12211021000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7070655061.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12211021000211 its reverse (11200012011221), we get a palindrome (23411033011432).
The spelling of 12211021000211 in words is "twelve trillion, two hundred eleven billion, twenty-one million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •