Base | Representation |
---|---|
bin | 1010111100100… |
… | …1000000101001 |
3 | 10012101120120100 |
4 | 2233021000221 |
5 | 43223141410 |
6 | 4320020013 |
7 | 1065150351 |
oct | 257110051 |
9 | 105346510 |
10 | 45912105 |
11 | 23a09498 |
12 | 13461609 |
13 | 9686835 |
14 | 6151b61 |
15 | 406d8c0 |
hex | 2bc9029 |
45912105 has 12 divisors (see below), whose sum is σ = 79581060. Its totient is φ = 24486432.
The previous prime is 45912103. The next prime is 45912107. The reversal of 45912105 is 50121954.
It is an interprime number because it is at equal distance from previous prime (45912103) and next prime (45912107).
It can be written as a sum of positive squares in 2 ways, for example, as 36252441 + 9659664 = 6021^2 + 3108^2 .
It is not a de Polignac number, because 45912105 - 21 = 45912103 is a prime.
It is not an unprimeable number, because it can be changed into a prime (45912101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 510090 + ... + 510179.
It is an arithmetic number, because the mean of its divisors is an integer number (6631755).
Almost surely, 245912105 is an apocalyptic number.
45912105 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
45912105 is a deficient number, since it is larger than the sum of its proper divisors (33668955).
45912105 is a wasteful number, since it uses less digits than its factorization.
45912105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020280 (or 1020277 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The square root of 45912105 is about 6775.8471795046. The cubic root of 45912105 is about 358.0764300057.
The spelling of 45912105 in words is "forty-five million, nine hundred twelve thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •