Base | Representation |
---|---|
bin | 1101110100100… |
… | …10011010111101 |
3 | 22002011112000221 |
4 | 12322102122331 |
5 | 214140134401 |
6 | 15301021341 |
7 | 2605333351 |
oct | 672223275 |
9 | 262145027 |
10 | 115943101 |
11 | 5a4a084a |
12 | 329b4851 |
13 | 1b0364b1 |
14 | 11581461 |
15 | a2a37a1 |
hex | 6e926bd |
115943101 has 4 divisors (see below), whose sum is σ = 115995132. Its totient is φ = 115891072.
The previous prime is 115943099. The next prime is 115943123. The reversal of 115943101 is 101349511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 101349511 = 193 ⋅525127.
It can be written as a sum of positive squares in 2 ways, for example, as 13912900 + 102030201 = 3730^2 + 10101^2 .
It is a cyclic number.
It is not a de Polignac number, because 115943101 - 21 = 115943099 is a prime.
It is a super-4 number, since 4×1159431014 (a number of 33 digits) contains 4444 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 (115913101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22516 + ... + 27181.
It is an arithmetic number, because the mean of its divisors is an integer number (28998783).
Almost surely, 2115943101 is an apocalyptic number.
It is an amenable number.
115943101 is a deficient number, since it is larger than the sum of its proper divisors (52031).
115943101 is an equidigital number, since it uses as much as digits as its factorization.
115943101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52030.
The product of its (nonzero) digits is 540, while the sum is 25.
The square root of 115943101 is about 10767.6878205119. The cubic root of 115943101 is about 487.6201427316.
The spelling of 115943101 in words is "one hundred fifteen million, nine hundred forty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •