Base | Representation |
---|---|
bin | 1001011110001001… |
… | …0001100011110001 |
3 | 20120011212110220221 |
4 | 2113202101203301 |
5 | 20201320010213 |
6 | 1100135133041 |
7 | 120000366616 |
oct | 22742214361 |
9 | 6504773827 |
10 | 2542344433 |
11 | 10950a6002 |
12 | 5ab514181 |
13 | 316937125 |
14 | 1a191450d |
15 | ed2e238d |
hex | 978918f1 |
2542344433 has 4 divisors (see below), whose sum is σ = 2542447600. Its totient is φ = 2542241268.
The previous prime is 2542344401. The next prime is 2542344443. The reversal of 2542344433 is 3344432452.
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 a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2542344433 - 25 = 2542344401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2542344443) 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, 9466 + ... + 71932.
It is an arithmetic number, because the mean of its divisors is an integer number (635611900).
Almost surely, 22542344433 is an apocalyptic number.
It is an amenable number.
2542344433 is a deficient number, since it is larger than the sum of its proper divisors (103167).
2542344433 is an equidigital number, since it uses as much as digits as its factorization.
2542344433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103166.
The product of its digits is 138240, while the sum is 34.
The square root of 2542344433 is about 50421.6663052700. Note that the first 3 decimals coincide. The cubic root of 2542344433 is about 1364.8286461676.
Adding to 2542344433 its reverse (3344432452), we get a palindrome (5886776885).
The spelling of 2542344433 in words is "two billion, five hundred forty-two million, three hundred forty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •