Base | Representation |
---|---|
bin | 1101100000101011110… |
… | …1100011100001010110 |
3 | 211012010021221112120122 |
4 | 3120022331203201112 |
5 | 12300331202024142 |
6 | 254344132431542 |
7 | 22524645441326 |
oct | 3301275434126 |
9 | 735107845518 |
10 | 232112142422 |
11 | 8a490287086 |
12 | 38b99a785b2 |
13 | 18b71163b94 |
14 | b33cc57286 |
15 | 60877131d2 |
hex | 360af63856 |
232112142422 has 4 divisors (see below), whose sum is σ = 348168213636. Its totient is φ = 116056071210.
The previous prime is 232112142421. The next prime is 232112142433. The reversal of 232112142422 is 224241211232.
It is a happy number.
232112142422 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 232112142391 and 232112142400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232112142421) 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, 58028035604 + ... + 58028035607.
It is an arithmetic number, because the mean of its divisors is an integer number (87042053409).
Almost surely, 2232112142422 is an apocalyptic number.
232112142422 is a deficient number, since it is larger than the sum of its proper divisors (116056071214).
232112142422 is a wasteful number, since it uses less digits than its factorization.
232112142422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116056071213.
The product of its digits is 3072, while the sum is 26.
Adding to 232112142422 its reverse (224241211232), we get a palindrome (456353353654).
The spelling of 232112142422 in words is "two hundred thirty-two billion, one hundred twelve million, one hundred forty-two thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •