Base | Representation |
---|---|
bin | 101010011000111010… |
… | …100100010111100001 |
3 | 11100111000210211222200 |
4 | 222120322210113201 |
5 | 1221203340204410 |
6 | 32524231523413 |
7 | 3200623334346 |
oct | 523072442741 |
9 | 140430724880 |
10 | 45515163105 |
11 | 18337139785 |
12 | 89a2b29569 |
13 | 43a4874b99 |
14 | 22bac507cd |
15 | 12b5c9e3c0 |
hex | a98ea45e1 |
45515163105 has 48 divisors (see below), whose sum is σ = 83450929536. Its totient is φ = 22901218560.
The previous prime is 45515163101. The next prime is 45515163167. The reversal of 45515163105 is 50136151554.
45515163105 is a `hidden beast` number, since 4 + 5 + 5 + 15 + 1 + 631 + 0 + 5 = 666.
It is not a de Polignac number, because 45515163105 - 22 = 45515163101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 45515163105.
It is not an unprimeable number, because it can be changed into a prime (45515163101) 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, 225651 + ... + 376760.
It is an arithmetic number, because the mean of its divisors is an integer number (1738561032).
Almost surely, 245515163105 is an apocalyptic number.
45515163105 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
45515163105 is a deficient number, since it is larger than the sum of its proper divisors (37935766431).
45515163105 is a wasteful number, since it uses less digits than its factorization.
45515163105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 602518 (or 602515 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 36.
The spelling of 45515163105 in words is "forty-five billion, five hundred fifteen million, one hundred sixty-three thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •