Base | Representation |
---|---|
bin | 10110010111101110… |
… | …10010000000100111 |
3 | 1011000000022102122222 |
4 | 23023313102000213 |
5 | 144044102414002 |
6 | 5303432142555 |
7 | 603424011431 |
oct | 131367220047 |
9 | 34000272588 |
10 | 12010201127 |
11 | 5103499961 |
12 | 23b2237a5b |
13 | 11952c6ab2 |
14 | 81d115651 |
15 | 4a45d81a2 |
hex | 2cbdd2027 |
12010201127 has 2 divisors, whose sum is σ = 12010201128. Its totient is φ = 12010201126.
The previous prime is 12010201121. The next prime is 12010201139. The reversal of 12010201127 is 72110201021.
12010201127 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12010201127 - 228 = 11741765671 is a prime.
It is a super-2 number, since 2×120102011272 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12010201121) 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 as a sum of consecutive naturals, namely, 6005100563 + 6005100564.
It is an arithmetic number, because the mean of its divisors is an integer number (6005100564).
Almost surely, 212010201127 is an apocalyptic number.
12010201127 is a deficient number, since it is larger than the sum of its proper divisors (1).
12010201127 is an equidigital number, since it uses as much as digits as its factorization.
12010201127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 12010201127 its reverse (72110201021), we get a palindrome (84120402148).
The spelling of 12010201127 in words is "twelve billion, ten million, two hundred one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •