Base | Representation |
---|---|
bin | 11101110011111011100101… |
… | …011001000010010100000001 |
3 | 122012020012001010020122220122 |
4 | 131303323211121002110001 |
5 | 114141114404134120413 |
6 | 1142504010334350025 |
7 | 36421350041511560 |
oct | 3563734531022401 |
9 | 565205033218818 |
10 | 131112020223233 |
11 | 3885a328372905 |
12 | 1285647a35b315 |
13 | 5820a6c755b8a |
14 | 2453bd9c29bd7 |
15 | 10257d0462108 |
hex | 773ee5642501 |
131112020223233 has 8 divisors (see below), whose sum is σ = 149852011877568. Its totient is φ = 112374454331664.
The previous prime is 131112020223221. The next prime is 131112020223259. The reversal of 131112020223233 is 332322020211131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131112020223233 - 220 = 131112019174657 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131112020223533) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 606324866 + ... + 606541067.
It is an arithmetic number, because the mean of its divisors is an integer number (18731501484696).
Almost surely, 2131112020223233 is an apocalyptic number.
It is an amenable number.
131112020223233 is a deficient number, since it is larger than the sum of its proper divisors (18739991654335).
131112020223233 is a wasteful number, since it uses less digits than its factorization.
131112020223233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1212881383.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 131112020223233 its reverse (332322020211131), we get a palindrome (463434040434364).
The spelling of 131112020223233 in words is "one hundred thirty-one trillion, one hundred twelve billion, twenty million, two hundred twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •