Base | Representation |
---|---|
bin | 110100100000110011… |
… | …1000011111000100011 |
3 | 101210002010110220011212 |
4 | 1221001213003320203 |
5 | 3321423044031014 |
6 | 123450014300335 |
7 | 11101354255511 |
oct | 1510147037043 |
9 | 353063426155 |
10 | 112769908259 |
11 | 43909745198 |
12 | 19a324b76ab |
13 | a83231c488 |
14 | 565b0134b1 |
15 | 2e0038b23e |
hex | 1a419c3e23 |
112769908259 has 4 divisors (see below), whose sum is σ = 112801830816. Its totient is φ = 112737985704.
The previous prime is 112769908241. The next prime is 112769908261. The reversal of 112769908259 is 952809967211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112769908259 - 216 = 112769842723 is a prime.
It is a super-2 number, since 2×1127699082592 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112769908198 and 112769908207.
It is not an unprimeable number, because it can be changed into a prime (112769928259) 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 3 ways as a sum of consecutive naturals, for example, 15955979 + ... + 15963044.
It is an arithmetic number, because the mean of its divisors is an integer number (28200457704).
Almost surely, 2112769908259 is an apocalyptic number.
112769908259 is a deficient number, since it is larger than the sum of its proper divisors (31922557).
112769908259 is an equidigital number, since it uses as much as digits as its factorization.
112769908259 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31922556.
The product of its (nonzero) digits is 4898880, while the sum is 59.
The spelling of 112769908259 in words is "one hundred twelve billion, seven hundred sixty-nine million, nine hundred eight thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •