Base | Representation |
---|---|
bin | 110100111011100110… |
… | …0111111011111101111 |
3 | 101212101210100201211021 |
4 | 1221313030333133233 |
5 | 3330243233403312 |
6 | 124115134035011 |
7 | 11132552635225 |
oct | 1516714773757 |
9 | 355353321737 |
10 | 113669044207 |
11 | 44230237354 |
12 | 1a043648a67 |
13 | a9466a2794 |
14 | 57045c6b15 |
15 | 2e54296c07 |
hex | 1a7733f7ef |
113669044207 has 8 divisors (see below), whose sum is σ = 114828047136. Its totient is φ = 112515547872.
The previous prime is 113669044201. The next prime is 113669044213. The reversal of 113669044207 is 702440966311.
It is an interprime number because it is at equal distance from previous prime (113669044201) and next prime (113669044213).
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 113669044207 - 227 = 113534826479 is a prime.
It is a super-2 number, since 2×1136690442072 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113669044201) 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, 1335148 + ... + 1417729.
It is an arithmetic number, because the mean of its divisors is an integer number (14353505892).
Almost surely, 2113669044207 is an apocalyptic number.
113669044207 is a deficient number, since it is larger than the sum of its proper divisors (1159002929).
113669044207 is a wasteful number, since it uses less digits than its factorization.
113669044207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2753297.
The product of its (nonzero) digits is 217728, while the sum is 43.
The spelling of 113669044207 in words is "one hundred thirteen billion, six hundred sixty-nine million, forty-four thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •