Base | Representation |
---|---|
bin | 1101011100111010110… |
… | …1001101000011001000 |
3 | 211002111211201111222201 |
4 | 3113032231031003020 |
5 | 12241243403114422 |
6 | 254055541125544 |
7 | 22460621661604 |
oct | 3271655150310 |
9 | 732454644881 |
10 | 231101223112 |
11 | 8a011685481 |
12 | 389573b98b4 |
13 | 18a3c8a2886 |
14 | b2848a6504 |
15 | 6028ac6727 |
hex | 35ceb4d0c8 |
231101223112 has 8 divisors (see below), whose sum is σ = 433314793350. Its totient is φ = 115550611552.
The previous prime is 231101223103. The next prime is 231101223127. The reversal of 231101223112 is 211322101132.
231101223112 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., 224234449156 + 6866773956 = 473534^2 + 82866^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 231101223112.
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, 14443826437 + ... + 14443826452.
Almost surely, 2231101223112 is an apocalyptic number.
It is an amenable number.
231101223112 is a deficient number, since it is larger than the sum of its proper divisors (202213570238).
231101223112 is a wasteful number, since it uses less digits than its factorization.
231101223112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28887652895 (or 28887652891 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 231101223112 its reverse (211322101132), we get a palindrome (442423324244).
The spelling of 231101223112 in words is "two hundred thirty-one billion, one hundred one million, two hundred twenty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •