Base | Representation |
---|---|
bin | 1010010001110010111… |
… | …00010100101000101111 |
3 | 1020202112200222211022121 |
4 | 11020321130110220233 |
5 | 21241223131403033 |
6 | 430122500253411 |
7 | 34341261226612 |
oct | 5107134245057 |
9 | 1222480884277 |
10 | 353151044143 |
11 | 126852615467 |
12 | 585396a1267 |
13 | 273c06590a1 |
14 | 13142156179 |
15 | 92bd9d162d |
hex | 5239714a2f |
353151044143 has 2 divisors, whose sum is σ = 353151044144. Its totient is φ = 353151044142.
The previous prime is 353151044123. The next prime is 353151044167. The reversal of 353151044143 is 341440151353.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-353151044143 is a prime.
It is a super-2 number, since 2×3531510441432 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 353151044099 and 353151044108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (353151044123) 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, 176575522071 + 176575522072.
It is an arithmetic number, because the mean of its divisors is an integer number (176575522072).
Almost surely, 2353151044143 is an apocalyptic number.
353151044143 is a deficient number, since it is larger than the sum of its proper divisors (1).
353151044143 is an equidigital number, since it uses as much as digits as its factorization.
353151044143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 353151044143 its reverse (341440151353), we get a palindrome (694591195496).
The spelling of 353151044143 in words is "three hundred fifty-three billion, one hundred fifty-one million, forty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •