Base | Representation |
---|---|
bin | 1010101111101… |
… | …1110010101011 |
3 | 10010210212111222 |
4 | 2223323302223 |
5 | 43014242111 |
6 | 4250012255 |
7 | 1055046611 |
oct | 253736253 |
9 | 103725458 |
10 | 45071531 |
11 | 234949aa |
12 | 1311708b |
13 | 945105b |
14 | 5db36b1 |
15 | 3e547db |
hex | 2afbcab |
45071531 has 4 divisors (see below), whose sum is σ = 45270312. Its totient is φ = 44872752.
The previous prime is 45071527. The next prime is 45071561. The reversal of 45071531 is 13517054.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 45071531 - 22 = 45071527 is a prime.
It is a super-2 number, since 2×450715312 = 4062885813367922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 45071531.
It is not an unprimeable number, because it can be changed into a prime (45071561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99050 + ... + 99503.
It is an arithmetic number, because the mean of its divisors is an integer number (11317578).
Almost surely, 245071531 is an apocalyptic number.
45071531 is a deficient number, since it is larger than the sum of its proper divisors (198781).
45071531 is a wasteful number, since it uses less digits than its factorization.
45071531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198780.
The product of its (nonzero) digits is 2100, while the sum is 26.
The square root of 45071531 is about 6713.5334213810. The cubic root of 45071531 is about 355.8776959622.
Adding to 45071531 its reverse (13517054), we get a palindrome (58588585).
The spelling of 45071531 in words is "forty-five million, seventy-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •