Base | Representation |
---|---|
bin | 1101100000101001001… |
… | …1011100100111101111 |
3 | 211012002112011201212022 |
4 | 3120022103130213233 |
5 | 12300320340312421 |
6 | 254343100100355 |
7 | 22524452555552 |
oct | 3301223344757 |
9 | 735075151768 |
10 | 232101104111 |
11 | 8a485027908 |
12 | 38b962346bb |
13 | 18b6ba9a836 |
14 | b33b5c2699 |
15 | 60867827ab |
hex | 360a4dc9ef |
232101104111 has 4 divisors (see below), whose sum is σ = 232847410224. Its totient is φ = 231354798000.
The previous prime is 232101104101. The next prime is 232101104117. The reversal of 232101104111 is 111401101232.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 232101104111 - 226 = 232033995247 is a prime.
It is a super-2 number, since 2×2321011041112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 232101104111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232101104117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 373152590 + ... + 373153211.
It is an arithmetic number, because the mean of its divisors is an integer number (58211852556).
Almost surely, 2232101104111 is an apocalyptic number.
232101104111 is a deficient number, since it is larger than the sum of its proper divisors (746306113).
232101104111 is an equidigital number, since it uses as much as digits as its factorization.
232101104111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 746306112.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 232101104111 its reverse (111401101232), we get a palindrome (343502205343).
The spelling of 232101104111 in words is "two hundred thirty-two billion, one hundred one million, one hundred four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •