Base | Representation |
---|---|
bin | 1010110111111… |
… | …0000010101000 |
3 | 10011210222100021 |
4 | 2231332002220 |
5 | 43133330112 |
6 | 4305250224 |
7 | 1062431164 |
oct | 255760250 |
9 | 104728307 |
10 | 45605032 |
11 | 23819810 |
12 | 13333974 |
13 | 95a9b35 |
14 | 60b1ca4 |
15 | 400c907 |
hex | 2b7e0a8 |
45605032 has 16 divisors (see below), whose sum is σ = 93283200. Its totient is φ = 20729520.
The previous prime is 45605017. The next prime is 45605047. The reversal of 45605032 is 23050654.
45605032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (45605017) and next prime (45605047).
It is a junction number, because it is equal to n+sod(n) for n = 45604988 and 45605006.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 259032 + ... + 259207.
It is an arithmetic number, because the mean of its divisors is an integer number (5830200).
Almost surely, 245605032 is an apocalyptic number.
It is an amenable number.
45605032 is an abundant number, since it is smaller than the sum of its proper divisors (47678168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45605032 is a wasteful number, since it uses less digits than its factorization.
45605032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518256 (or 518252 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 45605032 is about 6753.1497836195. The cubic root of 45605032 is about 357.2763384940.
Adding to 45605032 its reverse (23050654), we get a palindrome (68655686).
The spelling of 45605032 in words is "forty-five million, six hundred five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •