Base | Representation |
---|---|
bin | 110100010011110010… |
… | …1101101001110010001 |
3 | 101201221201000012220111 |
4 | 1220213211231032101 |
5 | 3320024314030211 |
6 | 123334421241321 |
7 | 11054503453354 |
oct | 1504745551621 |
9 | 351851005814 |
10 | 112333345681 |
11 | 43705277277 |
12 | 19930263241 |
13 | a792a48b1b |
14 | 561905229b |
15 | 2dc6da4421 |
hex | 1a2796d391 |
112333345681 has 8 divisors (see below), whose sum is σ = 112443252480. Its totient is φ = 112223495472.
The previous prime is 112333345679. The next prime is 112333345723. The reversal of 112333345681 is 186543333211.
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 112333345681 - 21 = 112333345679 is a prime.
It is a super-2 number, since 2×1123333456812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112333345651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4689571 + ... + 4713463.
It is an arithmetic number, because the mean of its divisors is an integer number (14055406560).
Almost surely, 2112333345681 is an apocalyptic number.
It is an amenable number.
112333345681 is a deficient number, since it is larger than the sum of its proper divisors (109906799).
112333345681 is a wasteful number, since it uses less digits than its factorization.
112333345681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28295.
The product of its digits is 155520, while the sum is 40.
Adding to 112333345681 its reverse (186543333211), we get a palindrome (298876678892).
The spelling of 112333345681 in words is "one hundred twelve billion, three hundred thirty-three million, three hundred forty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •