Base | Representation |
---|---|
bin | 10101001111101110… |
… | …10100001011110101 |
3 | 1002102220211112101122 |
4 | 22213313110023311 |
5 | 141324443332021 |
6 | 5123455033325 |
7 | 552441233426 |
oct | 124767241365 |
9 | 32386745348 |
10 | 11406230261 |
11 | 4923579688 |
12 | 2263b0b845 |
13 | 10ca13a99a |
14 | 7a2c1764d |
15 | 46b583bab |
hex | 2a7dd42f5 |
11406230261 has 2 divisors, whose sum is σ = 11406230262. Its totient is φ = 11406230260.
The previous prime is 11406230243. The next prime is 11406230287. The reversal of 11406230261 is 16203260411.
It is an a-pointer prime, because the next prime (11406230287) can be obtained adding 11406230261 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6989963236 + 4416267025 = 83606^2 + 66455^2 .
It is a cyclic number.
It is not a de Polignac number, because 11406230261 - 230 = 10332488437 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11406230261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11406235261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5703115130 + 5703115131.
It is an arithmetic number, because the mean of its divisors is an integer number (5703115131).
Almost surely, 211406230261 is an apocalyptic number.
It is an amenable number.
11406230261 is a deficient number, since it is larger than the sum of its proper divisors (1).
11406230261 is an equidigital number, since it uses as much as digits as its factorization.
11406230261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 11406230261 its reverse (16203260411), we get a palindrome (27609490672).
The spelling of 11406230261 in words is "eleven billion, four hundred six million, two hundred thirty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •