Base | Representation |
---|---|
bin | 10100111101101111… |
… | …10000111100110101 |
3 | 1002001101221011220011 |
4 | 22132313300330311 |
5 | 141022332300031 |
6 | 5100505140221 |
7 | 545626631434 |
oct | 123667607465 |
9 | 32041834804 |
10 | 11255353141 |
11 | 485639844a |
12 | 222148a671 |
13 | 10a4ac2796 |
14 | 78ab8111b |
15 | 45d1ce6b1 |
hex | 29edf0f35 |
11255353141 has 2 divisors, whose sum is σ = 11255353142. Its totient is φ = 11255353140.
The previous prime is 11255353139. The next prime is 11255353147. The reversal of 11255353141 is 14135355211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10801237041 + 454116100 = 103929^2 + 21310^2 .
It is a cyclic number.
It is not a de Polignac number, because 11255353141 - 21 = 11255353139 is a prime.
Together with 11255353139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11255353147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5627676570 + 5627676571.
It is an arithmetic number, because the mean of its divisors is an integer number (5627676571).
Almost surely, 211255353141 is an apocalyptic number.
It is an amenable number.
11255353141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11255353141 is an equidigital number, since it uses as much as digits as its factorization.
11255353141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9000, while the sum is 31.
The spelling of 11255353141 in words is "eleven billion, two hundred fifty-five million, three hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •