Base | Representation |
---|---|
bin | 10110111011100111… |
… | …00011000001000101 |
3 | 1011202222201101002120 |
4 | 23131303203001011 |
5 | 200203132241401 |
6 | 5353344000153 |
7 | 614040401436 |
oct | 133563430105 |
9 | 34688641076 |
10 | 12311212101 |
11 | 52483a3961 |
12 | 2477000059 |
13 | 1212789ab6 |
14 | 84b0ad48d |
15 | 4c0c46836 |
hex | 2ddce3045 |
12311212101 has 16 divisors (see below), whose sum is σ = 16818167808. Its totient is φ = 8006990000.
The previous prime is 12311212097. The next prime is 12311212103. The reversal of 12311212101 is 10121211321.
12311212101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12311212101 - 22 = 12311212097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12311212103) 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 15 ways as a sum of consecutive naturals, for example, 96525 + ... + 184226.
It is an arithmetic number, because the mean of its divisors is an integer number (1051135488).
Almost surely, 212311212101 is an apocalyptic number.
It is an amenable number.
12311212101 is a deficient number, since it is larger than the sum of its proper divisors (4506955707).
12311212101 is a wasteful number, since it uses less digits than its factorization.
12311212101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281112.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 12311212101 its reverse (10121211321), we get a palindrome (22432423422).
It can be divided in two parts, 12 and 311212101, that added together give a palindrome (311212113).
The spelling of 12311212101 in words is "twelve billion, three hundred eleven million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •