Base | Representation |
---|---|
bin | 1010101111000… |
… | …1100000011101 |
3 | 10010201201201202 |
4 | 2223301200131 |
5 | 43011420110 |
6 | 4245045245 |
7 | 1054513031 |
oct | 253614035 |
9 | 103651652 |
10 | 45029405 |
11 | 23466293 |
12 | 130b6825 |
13 | 9437b25 |
14 | 5da21c1 |
15 | 3e470a5 |
hex | 2af181d |
45029405 has 4 divisors (see below), whose sum is σ = 54035292. Its totient is φ = 36023520.
The previous prime is 45029401. The next prime is 45029429. The reversal of 45029405 is 50492054.
It is a happy number.
45029405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 23145721 + 21883684 = 4811^2 + 4678^2 .
It is not a de Polignac number, because 45029405 - 22 = 45029401 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 (45029401) 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 3 ways as a sum of consecutive naturals, for example, 4502936 + ... + 4502945.
It is an arithmetic number, because the mean of its divisors is an integer number (13508823).
Almost surely, 245029405 is an apocalyptic number.
It is an amenable number.
45029405 is a deficient number, since it is larger than the sum of its proper divisors (9005887).
45029405 is an equidigital number, since it uses as much as digits as its factorization.
45029405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9005886.
The product of its (nonzero) digits is 7200, while the sum is 29.
The square root of 45029405 is about 6710.3952938705. The cubic root of 45029405 is about 355.7667879857.
The spelling of 45029405 in words is "forty-five million, twenty-nine thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •