Base | Representation |
---|---|
bin | 110100100010111111100010… |
… | …001100000111011111111100 |
3 | 1010022021020111101211011020112 |
4 | 310202333202030013133330 |
5 | 220242343122112420012 |
6 | 2135303144252405152 |
7 | 66451435155241316 |
oct | 6442774214073774 |
9 | 1108236441734215 |
10 | 231103100123132 |
11 | 677003021a0826 |
12 | 21b053b47767b8 |
13 | 9bc4c0c845483 |
14 | 410d6420a47b6 |
15 | 1bab7c6a89122 |
hex | d22fe23077fc |
231103100123132 has 6 divisors (see below), whose sum is σ = 404430425215488. Its totient is φ = 115551550061564.
The previous prime is 231103100123099. The next prime is 231103100123143. The reversal of 231103100123132 is 231321001301132.
It is a super-3 number, since 3×2311031001231323 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 231103100123098 and 231103100123107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28887887515388 + ... + 28887887515395.
It is an arithmetic number, because the mean of its divisors is an integer number (67405070869248).
Almost surely, 2231103100123132 is an apocalyptic number.
It is an amenable number.
231103100123132 is a deficient number, since it is larger than the sum of its proper divisors (173327325092356).
231103100123132 is a wasteful number, since it uses less digits than its factorization.
231103100123132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57775775030787 (or 57775775030785 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 231103100123132 its reverse (231321001301132), we get a palindrome (462424101424264).
The spelling of 231103100123132 in words is "two hundred thirty-one trillion, one hundred three billion, one hundred million, one hundred twenty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •