Base | Representation |
---|---|
bin | 1101011011110… |
… | …10011011010101 |
3 | 21212001201002111 |
4 | 12231322123111 |
5 | 212322332333 |
6 | 15103311021 |
7 | 2535632533 |
oct | 655723325 |
9 | 255051074 |
10 | 112699093 |
11 | 58685551 |
12 | 318ab471 |
13 | 1a46ba70 |
14 | 10d79153 |
15 | 9d624cd |
hex | 6b7a6d5 |
112699093 has 8 divisors (see below), whose sum is σ = 121760408. Its totient is φ = 103693824.
The previous prime is 112699049. The next prime is 112699099. The reversal of 112699093 is 390996211.
It can be written as a sum of positive squares in 4 ways, for example, as 25220484 + 87478609 = 5022^2 + 9353^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112699093 - 217 = 112568021 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 (112699099) 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, 9780 + ... + 17917.
It is an arithmetic number, because the mean of its divisors is an integer number (15220051).
Almost surely, 2112699093 is an apocalyptic number.
112699093 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
112699093 is a deficient number, since it is larger than the sum of its proper divisors (9061315).
112699093 is a wasteful number, since it uses less digits than its factorization.
112699093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28023.
The product of its (nonzero) digits is 26244, while the sum is 40.
The square root of 112699093 is about 10615.9829031513. The cubic root of 112699093 is about 483.0292980755.
The spelling of 112699093 in words is "one hundred twelve million, six hundred ninety-nine thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •