Base | Representation |
---|---|
bin | 1011111100000110000… |
… | …1000110100101001111 |
3 | 201121102110220212021111 |
4 | 2333001201012211033 |
5 | 11330031144041221 |
6 | 234120514112451 |
7 | 20550551311003 |
oct | 2770141064517 |
9 | 647373825244 |
10 | 205110143311 |
11 | 79a94368537 |
12 | 33902b7b727 |
13 | 16459c33408 |
14 | 9cdaa54703 |
15 | 5506dd5be1 |
hex | 2fc184694f |
205110143311 has 2 divisors, whose sum is σ = 205110143312. Its totient is φ = 205110143310.
The previous prime is 205110143279. The next prime is 205110143363. The reversal of 205110143311 is 113341011502.
It is a happy number.
205110143311 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 205110143311 - 25 = 205110143279 is a prime.
It is a super-4 number, since 4×2051101433114 (a number of 46 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (205110149311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102555071655 + 102555071656.
It is an arithmetic number, because the mean of its divisors is an integer number (102555071656).
Almost surely, 2205110143311 is an apocalyptic number.
205110143311 is a deficient number, since it is larger than the sum of its proper divisors (1).
205110143311 is an equidigital number, since it uses as much as digits as its factorization.
205110143311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 205110143311 its reverse (113341011502), we get a palindrome (318451154813).
The spelling of 205110143311 in words is "two hundred five billion, one hundred ten million, one hundred forty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •