Base | Representation |
---|---|
bin | 1010010101010000100… |
… | …00010000011011001101 |
3 | 1020221100021020022001101 |
4 | 11022220100100123031 |
5 | 21304030044332031 |
6 | 431031151343101 |
7 | 34435324334551 |
oct | 5125020203315 |
9 | 1227307208041 |
10 | 355010152141 |
11 | 127616a80857 |
12 | 58978221a91 |
13 | 276288730a8 |
14 | 1327b017861 |
15 | 937bd13361 |
hex | 52a84106cd |
355010152141 has 2 divisors, whose sum is σ = 355010152142. Its totient is φ = 355010152140.
The previous prime is 355010152061. The next prime is 355010152177. The reversal of 355010152141 is 141251010553.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 303766322500 + 51243829641 = 551150^2 + 226371^2 .
It is a cyclic number.
It is not a de Polignac number, because 355010152141 - 213 = 355010143949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (355010152181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 177505076070 + 177505076071.
It is an arithmetic number, because the mean of its divisors is an integer number (177505076071).
Almost surely, 2355010152141 is an apocalyptic number.
It is an amenable number.
355010152141 is a deficient number, since it is larger than the sum of its proper divisors (1).
355010152141 is an equidigital number, since it uses as much as digits as its factorization.
355010152141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 355010152141 its reverse (141251010553), we get a palindrome (496261162694).
The spelling of 355010152141 in words is "three hundred fifty-five billion, ten million, one hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •