Base | Representation |
---|---|
bin | 10010111001000010… |
… | …00010101101110101 |
3 | 222011211011002010222 |
4 | 21130201002231311 |
5 | 131232334202331 |
6 | 4354220224125 |
7 | 506221300442 |
oct | 113441025565 |
9 | 28154132128 |
10 | 10142100341 |
11 | 4334a5110a |
12 | 1b7069b045 |
13 | c58281809 |
14 | 6c2d929c9 |
15 | 3e55cbb7b |
hex | 25c842b75 |
10142100341 has 4 divisors (see below), whose sum is σ = 10389468684. Its totient is φ = 9894732000.
The previous prime is 10142100323. The next prime is 10142100349. The reversal of 10142100341 is 14300124101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14300124101 = 157 ⋅91083593.
It can be written as a sum of positive squares in 2 ways, for example, as 4688277841 + 5453822500 = 68471^2 + 73850^2 .
It is a cyclic number.
It is not a de Polignac number, because 10142100341 - 218 = 10141838197 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 (10142100349) 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, 123684110 + ... + 123684191.
It is an arithmetic number, because the mean of its divisors is an integer number (2597367171).
Almost surely, 210142100341 is an apocalyptic number.
It is an amenable number.
10142100341 is a deficient number, since it is larger than the sum of its proper divisors (247368343).
10142100341 is an equidigital number, since it uses as much as digits as its factorization.
10142100341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247368342.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 10142100341 its reverse (14300124101), we get a palindrome (24442224442).
The spelling of 10142100341 in words is "ten billion, one hundred forty-two million, one hundred thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •