Base | Representation |
---|---|
bin | 110100010010111001… |
… | …0111000100000011101 |
3 | 101201212121100222000002 |
4 | 1220211302320200131 |
5 | 3314444112322331 |
6 | 123331424144045 |
7 | 11053656556310 |
oct | 1504562704035 |
9 | 351777328002 |
10 | 112303245341 |
11 | 4369a288461 |
12 | 19922168025 |
13 | a78973a281 |
14 | 5615058977 |
15 | 2dc440a9cb |
hex | 1a25cb881d |
112303245341 has 8 divisors (see below), whose sum is σ = 129115109760. Its totient is φ = 95683516848.
The previous prime is 112303245287. The next prime is 112303245361. The reversal of 112303245341 is 143542303211.
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 112303245341 - 218 = 112302983197 is a prime.
It is a super-2 number, since 2×1123032453412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112303245361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48032726 + ... + 48035063.
It is an arithmetic number, because the mean of its divisors is an integer number (16139388720).
Almost surely, 2112303245341 is an apocalyptic number.
It is an amenable number.
112303245341 is a deficient number, since it is larger than the sum of its proper divisors (16811864419).
112303245341 is an equidigital number, since it uses as much as digits as its factorization.
112303245341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96067963.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 112303245341 its reverse (143542303211), we get a palindrome (255845548552).
The spelling of 112303245341 in words is "one hundred twelve billion, three hundred three million, two hundred forty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.185 sec. • engine limits •