Base | Representation |
---|---|
bin | 1101100010101101000… |
… | …0100111101011010001 |
3 | 211020112001120022122112 |
4 | 3120223100213223101 |
5 | 12302433411323324 |
6 | 254514010515105 |
7 | 22544245315343 |
oct | 3305320475321 |
9 | 736461508575 |
10 | 232654011089 |
11 | 8a739140025 |
12 | 3910b435a95 |
13 | 18c294b8226 |
14 | b390bcb293 |
15 | 60ba09bc0e |
hex | 362b427ad1 |
232654011089 has 2 divisors, whose sum is σ = 232654011090. Its totient is φ = 232654011088.
The previous prime is 232654011059. The next prime is 232654011091. The reversal of 232654011089 is 980110456232.
232654011089 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 229632640000 + 3021371089 = 479200^2 + 54967^2 .
It is a cyclic number.
It is not a de Polignac number, because 232654011089 - 212 = 232654006993 is a prime.
Together with 232654011091, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (232654011049) 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, 116327005544 + 116327005545.
It is an arithmetic number, because the mean of its divisors is an integer number (116327005545).
Almost surely, 2232654011089 is an apocalyptic number.
It is an amenable number.
232654011089 is a deficient number, since it is larger than the sum of its proper divisors (1).
232654011089 is an equidigital number, since it uses as much as digits as its factorization.
232654011089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 41.
The spelling of 232654011089 in words is "two hundred thirty-two billion, six hundred fifty-four million, eleven thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •