Base | Representation |
---|---|
bin | 1010101110111… |
… | …1001111010011 |
3 | 10010201020222200 |
4 | 2223233033103 |
5 | 43011120430 |
6 | 4244534243 |
7 | 1054443660 |
oct | 253571723 |
9 | 103636880 |
10 | 45020115 |
11 | 2345a308 |
12 | 130b1383 |
13 | 943382a |
14 | 5d9ca67 |
15 | 3e44460 |
hex | 2aef3d3 |
45020115 has 48 divisors (see below), whose sum is σ = 89945856. Its totient is φ = 20404800.
The previous prime is 45020099. The next prime is 45020119. The reversal of 45020115 is 51102054.
45020115 = 3912 + 3922 + ... + 5792.
45020115 is a `hidden beast` number, since 450 + 201 + 15 = 666.
It is not a de Polignac number, because 45020115 - 24 = 45020099 is a prime.
It is a super-2 number, since 2×450201152 = 4053621509226450, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (45020119) 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 47 ways as a sum of consecutive naturals, for example, 40720 + ... + 41810.
It is an arithmetic number, because the mean of its divisors is an integer number (1873872).
Almost surely, 245020115 is an apocalyptic number.
45020115 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
45020115 is a deficient number, since it is larger than the sum of its proper divisors (44925741).
45020115 is a wasteful number, since it uses less digits than its factorization.
45020115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1240 (or 1237 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 18.
The square root of 45020115 is about 6709.7030485708. The cubic root of 45020115 is about 355.7423202645.
Adding to 45020115 its reverse (51102054), we get a palindrome (96122169).
The spelling of 45020115 in words is "forty-five million, twenty thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.592 sec. • engine limits •