Base | Representation |
---|---|
bin | 110100110001101011011101… |
… | …001000111001000000100101 |
3 | 1010102211201111112222101012212 |
4 | 310301223131020321000211 |
5 | 220410412024133041304 |
6 | 2141354533353253205 |
7 | 66614363661532142 |
oct | 6461533510710045 |
9 | 1112751445871185 |
10 | 232112332705829 |
11 | 67a5a318724754 |
12 | 22048b12704205 |
13 | 9c69139815ca4 |
14 | 41464227873c9 |
15 | 1bc7b93b2066e |
hex | d31add239025 |
232112332705829 has 2 divisors, whose sum is σ = 232112332705830. Its totient is φ = 232112332705828.
The previous prime is 232112332705811. The next prime is 232112332705843. The reversal of 232112332705829 is 928507233211232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 231120719049025 + 991613656804 = 15202655^2 + 995798^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232112332705829 is a prime.
It is a super-2 number, since 2×2321123327058292 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232112332705129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116056166352914 + 116056166352915.
It is an arithmetic number, because the mean of its divisors is an integer number (116056166352915).
Almost surely, 2232112332705829 is an apocalyptic number.
It is an amenable number.
232112332705829 is a deficient number, since it is larger than the sum of its proper divisors (1).
232112332705829 is an equidigital number, since it uses as much as digits as its factorization.
232112332705829 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2177280, while the sum is 50.
The spelling of 232112332705829 in words is "two hundred thirty-two trillion, one hundred twelve billion, three hundred thirty-two million, seven hundred five thousand, eight hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •