Base | Representation |
---|---|
bin | 1001011110000101… |
… | …1101011110111101 |
3 | 20120011110122022221 |
4 | 2113201131132331 |
5 | 20201241144013 |
6 | 1100130405341 |
7 | 116665521013 |
oct | 22741353675 |
9 | 6504418287 |
10 | 2542131133 |
11 | 1094a6a823 |
12 | 5ab430851 |
13 | 316891009 |
14 | 1a189a8b3 |
15 | ed29e08d |
hex | 9785d7bd |
2542131133 has 2 divisors, whose sum is σ = 2542131134. Its totient is φ = 2542131132.
The previous prime is 2542131131. The next prime is 2542131197. The reversal of 2542131133 is 3311312452.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2377342564 + 164788569 = 48758^2 + 12837^2 .
It is a cyclic number.
It is not a de Polignac number, because 2542131133 - 21 = 2542131131 is a prime.
Together with 2542131131, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2542131098 and 2542131107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2542131131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1271065566 + 1271065567.
It is an arithmetic number, because the mean of its divisors is an integer number (1271065567).
Almost surely, 22542131133 is an apocalyptic number.
It is an amenable number.
2542131133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2542131133 is an equidigital number, since it uses as much as digits as its factorization.
2542131133 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2160, while the sum is 25.
The square root of 2542131133 is about 50419.5510987553. The cubic root of 2542131133 is about 1364.7904758751.
Adding to 2542131133 its reverse (3311312452), we get a palindrome (5853443585).
The spelling of 2542131133 in words is "two billion, five hundred forty-two million, one hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •