Base | Representation |
---|---|
bin | 1010100100111101100101… |
… | …0110100110010101111001 |
3 | 1112011211101021100020112112 |
4 | 2221033121112212111321 |
5 | 3011021443000102421 |
6 | 40422445455222105 |
7 | 2310151201554524 |
oct | 251173126462571 |
9 | 45154337306475 |
10 | 11630123050361 |
11 | 37843422a1052 |
12 | 1379bb4817935 |
13 | 66493ca9aaca |
14 | 2c2c88335bbb |
15 | 1527d5d5a45b |
hex | a93d95a6579 |
11630123050361 has 2 divisors, whose sum is σ = 11630123050362. Its totient is φ = 11630123050360.
The previous prime is 11630123050339. The next prime is 11630123050379. The reversal of 11630123050361 is 16305032103611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11088933300025 + 541189750336 = 3330005^2 + 735656^2 .
It is an emirp because it is prime and its reverse (16305032103611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11630123050361 - 230 = 11629049308537 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11630123070361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5815061525180 + 5815061525181.
It is an arithmetic number, because the mean of its divisors is an integer number (5815061525181).
Almost surely, 211630123050361 is an apocalyptic number.
It is an amenable number.
11630123050361 is a deficient number, since it is larger than the sum of its proper divisors (1).
11630123050361 is an equidigital number, since it uses as much as digits as its factorization.
11630123050361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9720, while the sum is 32.
Adding to 11630123050361 its reverse (16305032103611), we get a palindrome (27935155153972).
The spelling of 11630123050361 in words is "eleven trillion, six hundred thirty billion, one hundred twenty-three million, fifty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •