Base | Representation |
---|---|
bin | 10110100011110001… |
… | …00110011001110101 |
3 | 1011021001101012221002 |
4 | 23101320212121311 |
5 | 144300432210401 |
6 | 5321441133045 |
7 | 606061405304 |
oct | 132170463165 |
9 | 34231335832 |
10 | 12111210101 |
11 | 515550a451 |
12 | 242002a185 |
13 | 11b0201913 |
14 | 82c6ca43b |
15 | 4ad3dba6b |
hex | 2d1e26675 |
12111210101 has 4 divisors (see below), whose sum is σ = 12113340204. Its totient is φ = 12109080000.
The previous prime is 12111210079. The next prime is 12111210113. The reversal of 12111210101 is 10101211121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6847562500 + 5263647601 = 82750^2 + 72551^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12111210101 is a prime.
It is a super-2 number, since 2×121112101012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12111210121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1056500 + ... + 1067901.
It is an arithmetic number, because the mean of its divisors is an integer number (3028335051).
Almost surely, 212111210101 is an apocalyptic number.
It is an amenable number.
12111210101 is a deficient number, since it is larger than the sum of its proper divisors (2130103).
12111210101 is an equidigital number, since it uses as much as digits as its factorization.
12111210101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2130102.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 12111210101 its reverse (10101211121), we get a palindrome (22212421222).
The spelling of 12111210101 in words is "twelve billion, one hundred eleven million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •