Base | Representation |
---|---|
bin | 101001111011101101… |
… | …001011000010001101 |
3 | 11022012212200200112100 |
4 | 221323231023002031 |
5 | 1214202412042310 |
6 | 32403444225313 |
7 | 3152523065463 |
oct | 517355130215 |
9 | 138185620470 |
10 | 45025112205 |
11 | 18105558237 |
12 | 888699b239 |
13 | 4327194438 |
14 | 2271b28833 |
15 | 1287c4dec0 |
hex | a7bb4b08d |
45025112205 has 24 divisors (see below), whose sum is σ = 79366304160. Its totient is φ = 23606385120.
The previous prime is 45025112203. The next prime is 45025112213. The reversal of 45025112205 is 50221152054.
45025112205 is a `hidden beast` number, since 450 + 2 + 5 + 1 + 1 + 2 + 205 = 666.
It is not a de Polignac number, because 45025112205 - 21 = 45025112203 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45025112203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8476651 + ... + 8481960.
It is an arithmetic number, because the mean of its divisors is an integer number (3306929340).
Almost surely, 245025112205 is an apocalyptic number.
45025112205 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
45025112205 is a deficient number, since it is larger than the sum of its proper divisors (34341191955).
45025112205 is a wasteful number, since it uses less digits than its factorization.
45025112205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16958681 (or 16958678 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
Adding to 45025112205 its reverse (50221152054), we get a palindrome (95246264259).
The spelling of 45025112205 in words is "forty-five billion, twenty-five million, one hundred twelve thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •