Base | Representation |
---|---|
bin | 10000110100111… |
… | …10111111011101 |
3 | 100211121200200110 |
4 | 20122132333131 |
5 | 242114113123 |
6 | 22001320233 |
7 | 3332562252 |
oct | 1032367735 |
9 | 324550613 |
10 | 141160413 |
11 | 727549a9 |
12 | 3b336079 |
13 | 23325594 |
14 | 14a67429 |
15 | c5d5493 |
hex | 869efdd |
141160413 has 4 divisors (see below), whose sum is σ = 188213888. Its totient is φ = 94106940.
The previous prime is 141160363. The next prime is 141160433. The reversal of 141160413 is 314061141.
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, and also an emirpimes, since its reverse is a distinct semiprime: 314061141 = 3 ⋅104687047.
It is a de Polignac number, because none of the positive numbers 2k-141160413 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 141160413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141160433) 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, 23526733 + ... + 23526738.
It is an arithmetic number, because the mean of its divisors is an integer number (47053472).
Almost surely, 2141160413 is an apocalyptic number.
It is an amenable number.
141160413 is a deficient number, since it is larger than the sum of its proper divisors (47053475).
141160413 is an equidigital number, since it uses as much as digits as its factorization.
141160413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47053474.
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 141160413 is about 11881.0947727892. The cubic root of 141160413 is about 520.6800926342.
The spelling of 141160413 in words is "one hundred forty-one million, one hundred sixty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •