Base | Representation |
---|---|
bin | 1010110000100… |
… | …0111001011011 |
3 | 10010220121011010 |
4 | 2230020321123 |
5 | 43023001321 |
6 | 4251105003 |
7 | 1055362245 |
oct | 254107133 |
9 | 103817133 |
10 | 45125211 |
11 | 2352126a |
12 | 13142163 |
13 | 946c611 |
14 | 5dc9095 |
15 | 3e65676 |
hex | 2b08e5b |
45125211 has 8 divisors (see below), whose sum is σ = 60244560. Its totient is φ = 30044672.
The previous prime is 45125203. The next prime is 45125221. The reversal of 45125211 is 11252154.
45125211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 45125211 - 23 = 45125203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (45125221) 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, 6870 + ... + 11723.
It is an arithmetic number, because the mean of its divisors is an integer number (7530570).
Almost surely, 245125211 is an apocalyptic number.
45125211 is a deficient number, since it is larger than the sum of its proper divisors (15119349).
45125211 is a wasteful number, since it uses less digits than its factorization.
45125211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19405.
The product of its digits is 400, while the sum is 21.
The square root of 45125211 is about 6717.5301264676. The cubic root of 45125211 is about 356.0189228464.
Adding to 45125211 its reverse (11252154), we get a palindrome (56377365).
It can be divided in two parts, 4 and 5125211, that added together give a palindrome (5125215).
The spelling of 45125211 in words is "forty-five million, one hundred twenty-five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •