Base | Representation |
---|---|
bin | 1010111000010… |
… | …0101111000101 |
3 | 10011212100221212 |
4 | 2232010233011 |
5 | 43140214303 |
6 | 4310021205 |
7 | 1062604136 |
oct | 256045705 |
9 | 104770855 |
10 | 45632453 |
11 | 23838379 |
12 | 13347805 |
13 | 95b9469 |
14 | 60bbc8d |
15 | 4015ad8 |
hex | 2b84bc5 |
45632453 has 8 divisors (see below), whose sum is σ = 46648056. Its totient is φ = 44625600.
The previous prime is 45632407. The next prime is 45632459. The reversal of 45632453 is 35423654.
45632453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 702244 + 44930209 = 838^2 + 6703^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 45632453 - 222 = 41438149 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 (45632459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8975 + ... + 13107.
It is an arithmetic number, because the mean of its divisors is an integer number (5831007).
Almost surely, 245632453 is an apocalyptic number.
It is an amenable number.
45632453 is a deficient number, since it is larger than the sum of its proper divisors (1015603).
45632453 is a wasteful number, since it uses less digits than its factorization.
45632453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4375.
The product of its digits is 43200, while the sum is 32.
The square root of 45632453 is about 6755.1797163362. The cubic root of 45632453 is about 357.3479308248.
The spelling of 45632453 in words is "forty-five million, six hundred thirty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •