Base | Representation |
---|---|
bin | 1010111001001… |
… | …0000101101011 |
3 | 10011222010222120 |
4 | 2232102011223 |
5 | 43143442042 |
6 | 4311122323 |
7 | 1063222452 |
oct | 256220553 |
9 | 104863876 |
10 | 45687147 |
11 | 23875480 |
12 | 133733a3 |
13 | 960831c |
14 | 60d3b99 |
15 | 4026dec |
hex | 2b9216b |
45687147 has 16 divisors (see below), whose sum is σ = 66724992. Its totient is φ = 27576320.
The previous prime is 45687137. The next prime is 45687203. The reversal of 45687147 is 74178654.
45687147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 45687147 - 214 = 45670763 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 45687099 and 45687108.
It is not an unprimeable number, because it can be changed into a prime (45687127) 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 15 ways as a sum of consecutive naturals, for example, 5788 + ... + 11174.
It is an arithmetic number, because the mean of its divisors is an integer number (4170312).
Almost surely, 245687147 is an apocalyptic number.
45687147 is a deficient number, since it is larger than the sum of its proper divisors (21037845).
45687147 is a wasteful number, since it uses less digits than its factorization.
45687147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5658.
The product of its digits is 188160, while the sum is 42.
The square root of 45687147 is about 6759.2268048942. The cubic root of 45687147 is about 357.4906434704.
The spelling of 45687147 in words is "forty-five million, six hundred eighty-seven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •