Base | Representation |
---|---|
bin | 11011100011001… |
… | …01101000100100 |
3 | 121002212020201211 |
4 | 31301211220210 |
5 | 433130244022 |
6 | 34533201204 |
7 | 5504225500 |
oct | 1561455044 |
9 | 532766654 |
10 | 231103012 |
11 | 1094a7128 |
12 | 65490204 |
13 | 38b5735a |
14 | 2299b300 |
15 | 1544ee77 |
hex | dc65a24 |
231103012 has 36 divisors (see below), whose sum is σ = 477114624. Its totient is φ = 97643280.
The previous prime is 231103009. The next prime is 231103021. The reversal of 231103012 is 210301132.
It is a junction number, because it is equal to n+sod(n) for n = 231102983 and 231103001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5613 + ... + 22219.
It is an arithmetic number, because the mean of its divisors is an integer number (13253184).
Almost surely, 2231103012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 231103012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (238557312).
231103012 is an abundant number, since it is smaller than the sum of its proper divisors (246011612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231103012 is a wasteful number, since it uses less digits than its factorization.
231103012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16696 (or 16687 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 231103012 is about 15202.0726218500. The cubic root of 231103012 is about 613.6704367974.
Adding to 231103012 its reverse (210301132), we get a palindrome (441404144).
The spelling of 231103012 in words is "two hundred thirty-one million, one hundred three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •