Base | Representation |
---|---|
bin | 100010000011001… |
… | …1100101011111101 |
3 | 2221121220002200022 |
4 | 1010012130223331 |
5 | 4314442303203 |
6 | 305212341525 |
7 | 40212303323 |
oct | 10406345375 |
9 | 2847802608 |
10 | 1142541053 |
11 | 536a31005 |
12 | 27a7748a5 |
13 | 152926cc4 |
14 | aba53d13 |
15 | 6a48aa38 |
hex | 4419cafd |
1142541053 has 4 divisors (see below), whose sum is σ = 1179397248. Its totient is φ = 1105684860.
The previous prime is 1142541013. The next prime is 1142541067. The reversal of 1142541053 is 3501452411.
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: 3501452411 = 19 ⋅184286969.
It is a cyclic number.
It is not a de Polignac number, because 1142541053 - 220 = 1141492477 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 (1142541013) 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, 18428051 + ... + 18428112.
It is an arithmetic number, because the mean of its divisors is an integer number (294849312).
Almost surely, 21142541053 is an apocalyptic number.
It is an amenable number.
1142541053 is a deficient number, since it is larger than the sum of its proper divisors (36856195).
1142541053 is an equidigital number, since it uses as much as digits as its factorization.
1142541053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36856194.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 1142541053 is about 33801.4948338088. The cubic root of 1142541053 is about 1045.4195191434.
Adding to 1142541053 its reverse (3501452411), we get a palindrome (4643993464).
The spelling of 1142541053 in words is "one billion, one hundred forty-two million, five hundred forty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •