Base | Representation |
---|---|
bin | 1000011100000010… |
… | …01101110111001010 |
3 | 102200201022100011221 |
4 | 10032001031313022 |
5 | 33234210322432 |
6 | 2025305112254 |
7 | 220155533446 |
oct | 41601156712 |
9 | 12621270157 |
10 | 4530167242 |
11 | 1a15185777 |
12 | a6518868a |
13 | 572709943 |
14 | 30d91d826 |
15 | 1b7a9bb97 |
hex | 10e04ddca |
4530167242 has 8 divisors (see below), whose sum is σ = 7194971556. Its totient is φ = 2131843392.
The previous prime is 4530167233. The next prime is 4530167249. The reversal of 4530167242 is 2427610354.
It can be written as a sum of positive squares in 2 ways, for example, as 3728201481 + 801965761 = 61059^2 + 28319^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (34), and also a Moran number because the ratio is a prime number: 133240213 = 4530167242 / (4 + 5 + 3 + 0 + 1 + 6 + 7 + 2 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 4530167198 and 4530167207.
It is not an unprimeable number, because it can be changed into a prime (4530167249) 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, 66620073 + ... + 66620140.
Almost surely, 24530167242 is an apocalyptic number.
4530167242 is a deficient number, since it is larger than the sum of its proper divisors (2664804314).
4530167242 is a wasteful number, since it uses less digits than its factorization.
4530167242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133240232.
The product of its (nonzero) digits is 40320, while the sum is 34.
The square root of 4530167242 is about 67306.5170841576. The cubic root of 4530167242 is about 1654.6446716347.
Adding to 4530167242 its reverse (2427610354), we get a palindrome (6957777596).
The spelling of 4530167242 in words is "four billion, five hundred thirty million, one hundred sixty-seven thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •