Base | Representation |
---|---|
bin | 110100100001100010010100… |
… | …010111000110010010101000 |
3 | 1010021220200010221211202011001 |
4 | 310201202110113012102220 |
5 | 220234223131043143422 |
6 | 2135145152352444344 |
7 | 66441262636322362 |
oct | 6441422427062250 |
9 | 1107820127752131 |
10 | 231003010131112 |
11 | 6767190aa8a35a |
12 | 21aa9b208496b4 |
13 | 9bb864b4b761b |
14 | 41088690d9d32 |
15 | 1ba8db99c5227 |
hex | d218945c64a8 |
231003010131112 has 16 divisors (see below), whose sum is σ = 433713592383840. Its totient is φ = 115346052162096.
The previous prime is 231003010131079. The next prime is 231003010131121. The reversal of 231003010131112 is 211131010300132.
It is a super-2 number, since 2×2310030101311122 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 231003010131112.
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 in 3 ways as a sum of consecutive naturals, for example, 19431606618 + ... + 19431618505.
It is an arithmetic number, because the mean of its divisors is an integer number (27107099523990).
Almost surely, 2231003010131112 is an apocalyptic number.
It is an amenable number.
231003010131112 is a deficient number, since it is larger than the sum of its proper divisors (202710582252728).
231003010131112 is a wasteful number, since it uses less digits than its factorization.
231003010131112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38863225872 (or 38863225868 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 231003010131112 its reverse (211131010300132), we get a palindrome (442134020431244).
The spelling of 231003010131112 in words is "two hundred thirty-one trillion, three billion, ten million, one hundred thirty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •