Base | Representation |
---|---|
bin | 10100100011111000010010… |
… | …01010110101111110101101 |
3 | 12221002100100211202110121012 |
4 | 22101330021022311332231 |
5 | 21411233241241444402 |
6 | 240054405214515005 |
7 | 12344360043503210 |
oct | 1221741112657655 |
9 | 187070324673535 |
10 | 45213274562477 |
11 | 1345192986801a |
12 | 50a2776205a65 |
13 | 1c2c793bb2298 |
14 | b24496d3d777 |
15 | 53617ae9b452 |
hex | 291f092b5fad |
45213274562477 has 8 divisors (see below), whose sum is σ = 51672501019392. Its totient is φ = 38754094914000.
The previous prime is 45213274562447. The next prime is 45213274562507. The reversal of 45213274562477 is 77426547231254.
It is an interprime number because it is at equal distance from previous prime (45213274562447) and next prime (45213274562507).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 45213274562477 - 210 = 45213274561453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45213274562437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9607274 + ... + 13517627.
It is an arithmetic number, because the mean of its divisors is an integer number (6459062627424).
Almost surely, 245213274562477 is an apocalyptic number.
It is an amenable number.
45213274562477 is a deficient number, since it is larger than the sum of its proper divisors (6459226456915).
45213274562477 is a wasteful number, since it uses less digits than its factorization.
45213274562477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23404219.
The product of its digits is 79027200, while the sum is 59.
The spelling of 45213274562477 in words is "forty-five trillion, two hundred thirteen billion, two hundred seventy-four million, five hundred sixty-two thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •