Base | Representation |
---|---|
bin | 11010111110010… |
… | …011011011010001 |
3 | 1011112112102022221 |
4 | 122332103123101 |
5 | 1411322240423 |
6 | 112523301041 |
7 | 14133345634 |
oct | 3276233321 |
9 | 1145472287 |
10 | 452540113 |
11 | 2124a10a3 |
12 | 10767a781 |
13 | 729a8c1c |
14 | 4415dc1b |
15 | 29ae0e5d |
hex | 1af936d1 |
452540113 has 4 divisors (see below), whose sum is σ = 453883300. Its totient is φ = 451196928.
The previous prime is 452540093. The next prime is 452540117. The reversal of 452540113 is 311045254.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 44782864 + 407757249 = 6692^2 + 20193^2 .
It is a cyclic number.
It is not a de Polignac number, because 452540113 - 225 = 418985681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (452540117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 671088 + ... + 671761.
It is an arithmetic number, because the mean of its divisors is an integer number (113470825).
Almost surely, 2452540113 is an apocalyptic number.
It is an amenable number.
452540113 is a deficient number, since it is larger than the sum of its proper divisors (1343187).
452540113 is a wasteful number, since it uses less digits than its factorization.
452540113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1343186.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 452540113 is about 21272.9902223453. The cubic root of 452540113 is about 767.7485890627.
Adding to 452540113 its reverse (311045254), we get a palindrome (763585367).
The spelling of 452540113 in words is "four hundred fifty-two million, five hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •