Base | Representation |
---|---|
bin | 1100001000000… |
… | …10000001001101 |
3 | 21002101220210122 |
4 | 12010002001031 |
5 | 202020021031 |
6 | 14032114325 |
7 | 2343415115 |
oct | 604020115 |
9 | 232356718 |
10 | 101720141 |
11 | 52466936 |
12 | 2a0959a5 |
13 | 180c6743 |
14 | d71c045 |
15 | 8de447b |
hex | 610204d |
101720141 has 4 divisors (see below), whose sum is σ = 104469372. Its totient is φ = 98970912.
The previous prime is 101720119. The next prime is 101720153. The reversal of 101720141 is 141027101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141027101 = 19 ⋅7422479.
It can be written as a sum of positive squares in 2 ways, for example, as 55071241 + 46648900 = 7421^2 + 6830^2 .
It is a cyclic number.
It is not a de Polignac number, because 101720141 - 214 = 101703757 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101720041) 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, 1374560 + ... + 1374633.
It is an arithmetic number, because the mean of its divisors is an integer number (26117343).
Almost surely, 2101720141 is an apocalyptic number.
It is an amenable number.
101720141 is a deficient number, since it is larger than the sum of its proper divisors (2749231).
101720141 is an equidigital number, since it uses as much as digits as its factorization.
101720141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2749230.
The product of its (nonzero) digits is 56, while the sum is 17.
The square root of 101720141 is about 10085.6403366370. The cubic root of 101720141 is about 466.8051633715.
Adding to 101720141 its reverse (141027101), we get a palindrome (242747242).
The spelling of 101720141 in words is "one hundred one million, seven hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •