Base | Representation |
---|---|
bin | 101101101110100100100001… |
… | …110100111101101011000111 |
3 | 222101002011021201111110022222 |
4 | 231232210201310331223013 |
5 | 202330011204224324211 |
6 | 1551421433301242555 |
7 | 60234615013241621 |
oct | 5556444164755307 |
9 | 871064251443288 |
10 | 201112411167431 |
11 | 59098327129105 |
12 | 1a680b2370345b |
13 | 882aa854502ba |
14 | 3793c6d579c11 |
15 | 183b5de42d1db |
hex | b6e921d3dac7 |
201112411167431 has 2 divisors, whose sum is σ = 201112411167432. Its totient is φ = 201112411167430.
The previous prime is 201112411167403. The next prime is 201112411167491. The reversal of 201112411167431 is 134761114211102.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201112411167431 is a prime.
It is a super-2 number, since 2×2011124111674312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201112411167391 and 201112411167400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201112411167491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100556205583715 + 100556205583716.
It is an arithmetic number, because the mean of its divisors is an integer number (100556205583716).
Almost surely, 2201112411167431 is an apocalyptic number.
201112411167431 is a deficient number, since it is larger than the sum of its proper divisors (1).
201112411167431 is an equidigital number, since it uses as much as digits as its factorization.
201112411167431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 35.
Adding to 201112411167431 its reverse (134761114211102), we get a palindrome (335873525378533).
The spelling of 201112411167431 in words is "two hundred one trillion, one hundred twelve billion, four hundred eleven million, one hundred sixty-seven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •