Base | Representation |
---|---|
bin | 110100100011100010001100… |
… | …110011100101010101011010 |
3 | 1010022101210120110222101110121 |
4 | 310203202030303211111122 |
5 | 220244000340004142132 |
6 | 2135332222001503454 |
7 | 66454223442641542 |
oct | 6443421463452532 |
9 | 1108353513871417 |
10 | 231140322334042 |
11 | 67715073161800 |
12 | 21b10662341b8a |
13 | 9bc8592276344 |
14 | 4111373790322 |
15 | 1bac754772497 |
hex | d2388cce555a |
231140322334042 has 24 divisors (see below), whose sum is σ = 381175074957600. Its totient is φ = 105041705494440.
The previous prime is 231140322334039. The next prime is 231140322334069. The reversal of 231140322334042 is 240433223041132.
It is a junction number, because it is equal to n+sod(n) for n = 231140322333989 and 231140322334007.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 99197692 + ... + 101501047.
It is an arithmetic number, because the mean of its divisors is an integer number (15882294789900).
Almost surely, 2231140322334042 is an apocalyptic number.
231140322334042 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
231140322334042 is a deficient number, since it is larger than the sum of its proper divisors (150034752623558).
231140322334042 is a wasteful number, since it uses less digits than its factorization.
231140322334042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200703522 (or 200703511 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 34.
Adding to 231140322334042 its reverse (240433223041132), we get a palindrome (471573545375174).
The spelling of 231140322334042 in words is "two hundred thirty-one trillion, one hundred forty billion, three hundred twenty-two million, three hundred thirty-four thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •