Base | Representation |
---|---|
bin | 110101111111010010… |
… | …0111110110101110101 |
3 | 102002021002001022020211 |
4 | 1223332210332311311 |
5 | 3344421201212031 |
6 | 125132350025421 |
7 | 11243051632252 |
oct | 1537644766565 |
9 | 362232038224 |
10 | 115940257141 |
11 | 45196286235 |
12 | 1a5781a8271 |
13 | ac190a8a67 |
14 | 587c0c0429 |
15 | 303887dbb1 |
hex | 1afe93ed75 |
115940257141 has 8 divisors (see below), whose sum is σ = 116832316160. Its totient is φ = 115051521312.
The previous prime is 115940257127. The next prime is 115940257157. The reversal of 115940257141 is 141752049511.
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 115940257141 - 215 = 115940224373 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115940257094 and 115940257103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115940257171) 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, 760731 + ... + 900328.
It is an arithmetic number, because the mean of its divisors is an integer number (14604039520).
Almost surely, 2115940257141 is an apocalyptic number.
It is an amenable number.
115940257141 is a deficient number, since it is larger than the sum of its proper divisors (892059019).
115940257141 is a wasteful number, since it uses less digits than its factorization.
115940257141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1661595.
The product of its (nonzero) digits is 50400, while the sum is 40.
The spelling of 115940257141 in words is "one hundred fifteen billion, nine hundred forty million, two hundred fifty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •