Base | Representation |
---|---|
bin | 11001011110000111111001… |
… | …101000010001100001110001 |
3 | 112200122010101010122001020220 |
4 | 121132013321220101201301 |
5 | 104140323434403200223 |
6 | 1034125502004123253 |
7 | 32411160340253316 |
oct | 3136077150214161 |
9 | 480563333561226 |
10 | 112021230131313 |
11 | 32769a34026948 |
12 | 1069256b396529 |
13 | 4a677310245b9 |
14 | 1d93bdc20ad0d |
15 | ce3de14496e3 |
hex | 65e1f9a11871 |
112021230131313 has 8 divisors (see below), whose sum is σ = 149462356054368. Its totient is φ = 74630462147904.
The previous prime is 112021230131311. The next prime is 112021230131353. The reversal of 112021230131313 is 313131032120211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112021230131313 - 21 = 112021230131311 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112021230131311) 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, 12589479720 + ... + 12589488617.
It is an arithmetic number, because the mean of its divisors is an integer number (18682794506796).
Almost surely, 2112021230131313 is an apocalyptic number.
It is an amenable number.
112021230131313 is a deficient number, since it is larger than the sum of its proper divisors (37441125923055).
112021230131313 is a wasteful number, since it uses less digits than its factorization.
112021230131313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25178969823.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 112021230131313 its reverse (313131032120211), we get a palindrome (425152262251524).
The spelling of 112021230131313 in words is "one hundred twelve trillion, twenty-one billion, two hundred thirty million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •