Base | Representation |
---|---|
bin | 1010101111001… |
… | …0000010101101 |
3 | 10010201211201221 |
4 | 2223302002231 |
5 | 43012002342 |
6 | 4245103341 |
7 | 1054522312 |
oct | 253620255 |
9 | 103654657 |
10 | 45031597 |
11 | 234679a6 |
12 | 130b7b51 |
13 | 9438b20 |
14 | 5da2d09 |
15 | 3e47a67 |
hex | 2af20ad |
45031597 has 8 divisors (see below), whose sum is σ = 49041720. Its totient is φ = 41099520.
The previous prime is 45031559. The next prime is 45031607. The reversal of 45031597 is 79513054.
45031597 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 5517801 + 39513796 = 2349^2 + 6286^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 45031597 - 215 = 44998829 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45031507) 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, 18304 + ... + 20617.
It is an arithmetic number, because the mean of its divisors is an integer number (6130215).
Almost surely, 245031597 is an apocalyptic number.
It is an amenable number.
45031597 is a deficient number, since it is larger than the sum of its proper divisors (4010123).
45031597 is a wasteful number, since it uses less digits than its factorization.
45031597 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39023.
The product of its (nonzero) digits is 18900, while the sum is 34.
The square root of 45031597 is about 6710.5586205621. The cubic root of 45031597 is about 355.7725607183.
The spelling of 45031597 in words is "forty-five million, thirty-one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •