Base | Representation |
---|---|
bin | 1101110100101… |
… | …11000001010101 |
3 | 22002012110212201 |
4 | 12322113001111 |
5 | 214141240231 |
6 | 15301244501 |
7 | 2605442314 |
oct | 672270125 |
9 | 262173781 |
10 | 115961941 |
11 | 5a503a17 |
12 | 32a03731 |
13 | 1b041c44 |
14 | 1158827b |
15 | a2a9161 |
hex | 6e97055 |
115961941 has 4 divisors (see below), whose sum is σ = 116115084. Its totient is φ = 115808800.
The previous prime is 115961897. The next prime is 115961953. The reversal of 115961941 is 149169511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 149169511 = 271 ⋅550441.
It can be written as a sum of positive squares in 2 ways, for example, as 10304100 + 105657841 = 3210^2 + 10279^2 .
It is a cyclic number.
It is not a de Polignac number, because 115961941 - 213 = 115953749 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 115961941.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115961971) 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, 75430 + ... + 76951.
It is an arithmetic number, because the mean of its divisors is an integer number (29028771).
Almost surely, 2115961941 is an apocalyptic number.
It is an amenable number.
115961941 is a deficient number, since it is larger than the sum of its proper divisors (153143).
115961941 is an equidigital number, since it uses as much as digits as its factorization.
115961941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153142.
The product of its digits is 9720, while the sum is 37.
The square root of 115961941 is about 10768.5626246032. The cubic root of 115961941 is about 487.6465530019.
The spelling of 115961941 in words is "one hundred fifteen million, nine hundred sixty-one thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •