Base | Representation |
---|---|
bin | 11001100100001111111110… |
… | …110000101000100101101101 |
3 | 112202010101000211222211210102 |
4 | 121210033332300220211231 |
5 | 104214223133042112023 |
6 | 1035051124422320445 |
7 | 32453453051525660 |
oct | 3144177660504555 |
9 | 482111024884712 |
10 | 112442223004013 |
11 | 3291152a583211 |
12 | 10740080b89125 |
13 | 4a983439505b6 |
14 | 1daa3384a96d7 |
15 | ceed30d33628 |
hex | 6643fec2896d |
112442223004013 has 8 divisors (see below), whose sum is σ = 128918598357120. Its totient is φ = 96069147810480.
The previous prime is 112442223003991. The next prime is 112442223004021. The reversal of 112442223004013 is 310400322244211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112442223004013 - 218 = 112442222741869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112442223003013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25825037558 + ... + 25825041911.
It is an arithmetic number, because the mean of its divisors is an integer number (16114824794640).
Almost surely, 2112442223004013 is an apocalyptic number.
It is an amenable number.
112442223004013 is a deficient number, since it is larger than the sum of its proper divisors (16476375353107).
112442223004013 is an equidigital number, since it uses as much as digits as its factorization.
112442223004013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51650079787.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 112442223004013 its reverse (310400322244211), we get a palindrome (422842545248224).
The spelling of 112442223004013 in words is "one hundred twelve trillion, four hundred forty-two billion, two hundred twenty-three million, four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •