Base | Representation |
---|---|
bin | 1000001110001011101… |
… | …1111011111011100101 |
3 | 111111120200212022020201 |
4 | 2003202323323323211 |
5 | 4303233024110021 |
6 | 144515422430501 |
7 | 13130133610261 |
oct | 2034273737345 |
9 | 444520768221 |
10 | 141246316261 |
11 | 549a1954a86 |
12 | 2345b132431 |
13 | 1041cb51c3b |
14 | 6b9cd770a1 |
15 | 3a1a35a591 |
hex | 20e2efbee5 |
141246316261 has 4 divisors (see below), whose sum is σ = 141673042624. Its totient is φ = 140819589900.
The previous prime is 141246316247. The next prime is 141246316303. The reversal of 141246316261 is 162613642141.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 141246316261 - 211 = 141246314213 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 141246316261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141246313261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 213362685 + ... + 213363346.
It is an arithmetic number, because the mean of its divisors is an integer number (35418260656).
Almost surely, 2141246316261 is an apocalyptic number.
It is an amenable number.
141246316261 is a deficient number, since it is larger than the sum of its proper divisors (426726363).
141246316261 is an equidigital number, since it uses as much as digits as its factorization.
141246316261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426726362.
The product of its digits is 41472, while the sum is 37.
The spelling of 141246316261 in words is "one hundred forty-one billion, two hundred forty-six million, three hundred sixteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •