Base | Representation |
---|---|
bin | 10000001010101111011001… |
… | …11110011100011001101111 |
3 | 11122212212120222100220122122 |
4 | 20011113230332130121233 |
5 | 14130001401021214411 |
6 | 203341003221103155 |
7 | 10326435615401264 |
oct | 1005275476343157 |
9 | 148785528326578 |
10 | 35553420101231 |
11 | 103681368537aa |
12 | 3ba25a8557abb |
13 | 16ab899b34326 |
14 | 8acb1a9a726b |
15 | 419c5cd9b9db |
hex | 2055ecf9c66f |
35553420101231 has 2 divisors, whose sum is σ = 35553420101232. Its totient is φ = 35553420101230.
The previous prime is 35553420101197. The next prime is 35553420101237. The reversal of 35553420101231 is 13210102435553.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-35553420101231 is a prime.
It is a super-2 number, since 2×355534201012312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 35553420101191 and 35553420101200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (35553420101237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17776710050615 + 17776710050616.
It is an arithmetic number, because the mean of its divisors is an integer number (17776710050616).
Almost surely, 235553420101231 is an apocalyptic number.
35553420101231 is a deficient number, since it is larger than the sum of its proper divisors (1).
35553420101231 is an equidigital number, since it uses as much as digits as its factorization.
35553420101231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 35553420101231 its reverse (13210102435553), we get a palindrome (48763522536784).
The spelling of 35553420101231 in words is "thirty-five trillion, five hundred fifty-three billion, four hundred twenty million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •