Base | Representation |
---|---|
bin | 1010110001001… |
… | …1000110110101 |
3 | 10010222201111221 |
4 | 2230103012311 |
5 | 43030321104 |
6 | 4252030341 |
7 | 1055625205 |
oct | 254230665 |
9 | 103881457 |
10 | 45167029 |
11 | 2354a726 |
12 | 131623b1 |
13 | 948566b |
14 | 5dda405 |
15 | 3e72c54 |
hex | 2b131b5 |
45167029 has 2 divisors, whose sum is σ = 45167030. Its totient is φ = 45167028.
The previous prime is 45167027. The next prime is 45167041. The reversal of 45167029 is 92076154.
45167029 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28068804 + 17098225 = 5298^2 + 4135^2 .
It is a cyclic number.
It is not a de Polignac number, because 45167029 - 21 = 45167027 is a prime.
Together with 45167027, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 45166985 and 45167003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45167027) 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 as a sum of consecutive naturals, namely, 22583514 + 22583515.
It is an arithmetic number, because the mean of its divisors is an integer number (22583515).
Almost surely, 245167029 is an apocalyptic number.
It is an amenable number.
45167029 is a deficient number, since it is larger than the sum of its proper divisors (1).
45167029 is an equidigital number, since it uses as much as digits as its factorization.
45167029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 34.
The square root of 45167029 is about 6720.6420080227. The cubic root of 45167029 is about 356.1288643654.
The spelling of 45167029 in words is "forty-five million, one hundred sixty-seven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •