Base | Representation |
---|---|
bin | 110100110011000110011011… |
… | …110100101001111101111011 |
3 | 1010110012001122121222111200221 |
4 | 310303012123310221331323 |
5 | 220414012110402130412 |
6 | 2141511451103240511 |
7 | 66624422536454626 |
oct | 6463063364517573 |
9 | 1113161577874627 |
10 | 232210021130107 |
11 | 67a97798252799 |
12 | 22063a362a9137 |
13 | 9c75407459737 |
14 | 414b04c804dbd |
15 | 1bca4aee4db07 |
hex | d3319bd29f7b |
232210021130107 has 2 divisors, whose sum is σ = 232210021130108. Its totient is φ = 232210021130106.
The previous prime is 232210021129997. The next prime is 232210021130123. The reversal of 232210021130107 is 701031120012232.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 232210021130107 - 219 = 232210020605819 is a prime.
It is a super-3 number, since 3×2322100211301073 (a number of 44 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (232210021130137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116105010565053 + 116105010565054.
It is an arithmetic number, because the mean of its divisors is an integer number (116105010565054).
Almost surely, 2232210021130107 is an apocalyptic number.
232210021130107 is a deficient number, since it is larger than the sum of its proper divisors (1).
232210021130107 is an equidigital number, since it uses as much as digits as its factorization.
232210021130107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 25.
Adding to 232210021130107 its reverse (701031120012232), we get a palindrome (933241141142339).
The spelling of 232210021130107 in words is "two hundred thirty-two trillion, two hundred ten billion, twenty-one million, one hundred thirty thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •