Base | Representation |
---|---|
bin | 1101100000101011100… |
… | …1001100101000111011 |
3 | 211012010012210111122021 |
4 | 3120022321030220323 |
5 | 12300330404000443 |
6 | 254344052135311 |
7 | 22524632643112 |
oct | 3301271145073 |
9 | 735105714567 |
10 | 232111000123 |
11 | 8a48a676932 |
12 | 38b99607537 |
13 | 18b70b53c72 |
14 | b33ca3ac79 |
15 | 60875899ed |
hex | 360ae4ca3b |
232111000123 has 2 divisors, whose sum is σ = 232111000124. Its totient is φ = 232111000122.
The previous prime is 232111000109. The next prime is 232111000133. The reversal of 232111000123 is 321000111232.
232111000123 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232111000123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 232111000097 and 232111000106.
It is not a weakly prime, because it can be changed into another prime (232111000133) 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, 116055500061 + 116055500062.
It is an arithmetic number, because the mean of its divisors is an integer number (116055500062).
Almost surely, 2232111000123 is an apocalyptic number.
232111000123 is a deficient number, since it is larger than the sum of its proper divisors (1).
232111000123 is an equidigital number, since it uses as much as digits as its factorization.
232111000123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 232111000123 its reverse (321000111232), we get a palindrome (553111111355).
The spelling of 232111000123 in words is "two hundred thirty-two billion, one hundred eleven million, one hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •