Base | Representation |
---|---|
bin | 1001010011100110000010… |
… | …0101110000110101000001 |
3 | 1100020012011212212020102021 |
4 | 2110321200211300311001 |
5 | 2320121103022024022 |
6 | 33432342303521441 |
7 | 2104153156101445 |
oct | 224714045606501 |
9 | 40205155766367 |
10 | 10232232611137 |
11 | 3295513612019 |
12 | 11930a9bb9281 |
13 | 592b8424b764 |
14 | 275357d84825 |
15 | 12b26d0007c7 |
hex | 94e60970d41 |
10232232611137 has 2 divisors, whose sum is σ = 10232232611138. Its totient is φ = 10232232611136.
The previous prime is 10232232611131. The next prime is 10232232611171. The reversal of 10232232611137 is 73111623223201.
It is an a-pointer prime, because the next prime (10232232611171) can be obtained adding 10232232611137 to its sum of digits (34).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5309909096976 + 4922323514161 = 2304324^2 + 2218631^2 .
It is a cyclic number.
It is not a de Polignac number, because 10232232611137 - 231 = 10230085127489 is a prime.
It is not a weakly prime, because it can be changed into another prime (10232232611131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5116116305568 + 5116116305569.
It is an arithmetic number, because the mean of its divisors is an integer number (5116116305569).
Almost surely, 210232232611137 is an apocalyptic number.
It is an amenable number.
10232232611137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10232232611137 is an equidigital number, since it uses as much as digits as its factorization.
10232232611137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18144, while the sum is 34.
Adding to 10232232611137 its reverse (73111623223201), we get a palindrome (83343855834338).
The spelling of 10232232611137 in words is "ten trillion, two hundred thirty-two billion, two hundred thirty-two million, six hundred eleven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •