Base | Representation |
---|---|
bin | 10101110000011011110111… |
… | …000110111111111000000101 |
3 | 110112210121222022210202121102 |
4 | 111300123313012333320011 |
5 | 100020220322332232031 |
6 | 535302110333225445 |
7 | 26104121435330141 |
oct | 2560336706777005 |
9 | 415717868722542 |
10 | 95687427227141 |
11 | 285418a0115a42 |
12 | a894a45932285 |
13 | 4151393802359 |
14 | 198b420a56221 |
15 | b0e0b24947cb |
hex | 5706f71bfe05 |
95687427227141 has 4 divisors (see below), whose sum is σ = 95743417531500. Its totient is φ = 95631436922784.
The previous prime is 95687427227129. The next prime is 95687427227179. The reversal of 95687427227141 is 14172272478659.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 28205966843041 + 67481460384100 = 5310929^2 + 8214710^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-95687427227141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (95687427527141) 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, 27995149616 + ... + 27995153033.
It is an arithmetic number, because the mean of its divisors is an integer number (23935854382875).
Almost surely, 295687427227141 is an apocalyptic number.
It is an amenable number.
95687427227141 is a deficient number, since it is larger than the sum of its proper divisors (55990304359).
95687427227141 is a wasteful number, since it uses less digits than its factorization.
95687427227141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55990304358.
The product of its digits is 94832640, while the sum is 65.
The spelling of 95687427227141 in words is "ninety-five trillion, six hundred eighty-seven billion, four hundred twenty-seven million, two hundred twenty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •