Base | Representation |
---|---|
bin | 10011010000110000… |
… | …10101111000011101 |
3 | 222200200200122122122 |
4 | 21220120111320131 |
5 | 132134313134031 |
6 | 4430050352325 |
7 | 514156202054 |
oct | 115030257035 |
9 | 28620618578 |
10 | 10341146141 |
11 | 4427342177 |
12 | 200728b6a5 |
13 | c8a5936b1 |
14 | 7015a739b |
15 | 407ce847b |
hex | 268615e1d |
10341146141 has 4 divisors (see below), whose sum is σ = 10341398172. Its totient is φ = 10340894112.
The previous prime is 10341146113. The next prime is 10341146143. The reversal of 10341146141 is 14164114301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14164114301 = 43 ⋅329398007.
It can be written as a sum of positive squares in 2 ways, for example, as 10186864900 + 154281241 = 100930^2 + 12421^2 .
It is a cyclic number.
It is not a de Polignac number, because 10341146141 - 26 = 10341146077 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 10341146141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10341146143) 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, 48626 + ... + 151811.
It is an arithmetic number, because the mean of its divisors is an integer number (2585349543).
Almost surely, 210341146141 is an apocalyptic number.
It is an amenable number.
10341146141 is a deficient number, since it is larger than the sum of its proper divisors (252031).
10341146141 is an equidigital number, since it uses as much as digits as its factorization.
10341146141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 252030.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 10341146141 in words is "ten billion, three hundred forty-one million, one hundred forty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •