Base | Representation |
---|---|
bin | 1001010011100110000010… |
… | …0011011110010110000001 |
3 | 1100020012011211201202101001 |
4 | 2110321200203132112001 |
5 | 2320121102343324022 |
6 | 33432342243012001 |
7 | 2104153151022253 |
oct | 224714043362601 |
9 | 40205154652331 |
10 | 10232232011137 |
11 | 3295513242254 |
12 | 11930a996a001 |
13 | 592b8409b626 |
14 | 275357c69cd3 |
15 | 12b26ce32b27 |
hex | 94e608de581 |
10232232011137 has 2 divisors, whose sum is σ = 10232232011138. Its totient is φ = 10232232011136.
The previous prime is 10232232011077. The next prime is 10232232011153. The reversal of 10232232011137 is 73111023223201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9187664205456 + 1044567805681 = 3031116^2 + 1022041^2 .
It is a cyclic number.
It is not a de Polignac number, because 10232232011137 - 231 = 10230084527489 is a prime.
It is not a weakly prime, because it can be changed into another prime (10232232611137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5116116005568 + 5116116005569.
It is an arithmetic number, because the mean of its divisors is an integer number (5116116005569).
Almost surely, 210232232011137 is an apocalyptic number.
It is an amenable number.
10232232011137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10232232011137 is an equidigital number, since it uses as much as digits as its factorization.
10232232011137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 10232232011137 its reverse (73111023223201), we get a palindrome (83343255234338).
The spelling of 10232232011137 in words is "ten trillion, two hundred thirty-two billion, two hundred thirty-two million, eleven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •