Base | Representation |
---|---|
bin | 100010100111001… |
… | …1110100100100101 |
3 | 2222221102102000220 |
4 | 1011032132210211 |
5 | 4334311020031 |
6 | 311125154553 |
7 | 40531635204 |
oct | 10516364445 |
9 | 2887372026 |
10 | 1161423141 |
11 | 54665843a |
12 | 284b5ba59 |
13 | 156808638 |
14 | b036b23b |
15 | 6be6a596 |
hex | 4539e925 |
1161423141 has 4 divisors (see below), whose sum is σ = 1548564192. Its totient is φ = 774282092.
The previous prime is 1161423097. The next prime is 1161423143. The reversal of 1161423141 is 1413241611.
It is a happy number.
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: 1413241611 = 3 ⋅471080537.
It is a cyclic number.
It is not a de Polignac number, because 1161423141 - 29 = 1161422629 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1161423143) 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, 193570521 + ... + 193570526.
It is an arithmetic number, because the mean of its divisors is an integer number (387141048).
Almost surely, 21161423141 is an apocalyptic number.
It is an amenable number.
1161423141 is a deficient number, since it is larger than the sum of its proper divisors (387141051).
1161423141 is an equidigital number, since it uses as much as digits as its factorization.
1161423141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387141050.
The product of its digits is 576, while the sum is 24.
The square root of 1161423141 is about 34079.6587570944. The cubic root of 1161423141 is about 1051.1470883398.
Adding to 1161423141 its reverse (1413241611), we get a palindrome (2574664752).
The spelling of 1161423141 in words is "one billion, one hundred sixty-one million, four hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •