Base | Representation |
---|---|
bin | 1101100001000111111… |
… | …1100100011110001000 |
3 | 211012102111220222012101 |
4 | 3120101333210132020 |
5 | 12301101402023422 |
6 | 254403545123144 |
7 | 22530610242346 |
oct | 3302177443610 |
9 | 735374828171 |
10 | 232230111112 |
11 | 8a54093076a |
12 | 390114894b4 |
13 | 18b8c72933c |
14 | b3507a4996 |
15 | 6092c66c27 |
hex | 3611fe4788 |
232230111112 has 8 divisors (see below), whose sum is σ = 435431458350. Its totient is φ = 116115055552.
The previous prime is 232230111097. The next prime is 232230111133. The reversal of 232230111112 is 211111032232.
232230111112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 220837964356 + 11392146756 = 469934^2 + 106734^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 232230111112.
It is an unprimeable number.
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, 14514381937 + ... + 14514381952.
Almost surely, 2232230111112 is an apocalyptic number.
It is an amenable number.
232230111112 is a deficient number, since it is larger than the sum of its proper divisors (203201347238).
232230111112 is a wasteful number, since it uses less digits than its factorization.
232230111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29028763895 (or 29028763891 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 232230111112 its reverse (211111032232), we get a palindrome (443341143344).
The spelling of 232230111112 in words is "two hundred thirty-two billion, two hundred thirty million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •