Base | Representation |
---|---|
bin | 1001101110111010… |
… | …00001011011101011 |
3 | 111111011100212112120 |
4 | 10313131001123223 |
5 | 41200140302334 |
6 | 2222300442323 |
7 | 243326335365 |
oct | 46735013353 |
9 | 14434325476 |
10 | 5225322219 |
11 | 2241615a17 |
12 | 1019b493a3 |
13 | 653740950 |
14 | 377d95d35 |
15 | 208b13949 |
hex | 1377416eb |
5225322219 has 8 divisors (see below), whose sum is σ = 7503026832. Its totient is φ = 3215582880.
The previous prime is 5225322173. The next prime is 5225322227. The reversal of 5225322219 is 9122235225.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5225322219 - 211 = 5225320171 is a prime.
It is a super-2 number, since 2×52253222192 = 54607984584750167922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5225322219.
It is not an unprimeable number, because it can be changed into a prime (5225322019) 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 7 ways as a sum of consecutive naturals, for example, 66991272 + ... + 66991349.
It is an arithmetic number, because the mean of its divisors is an integer number (937878354).
Almost surely, 25225322219 is an apocalyptic number.
5225322219 is a deficient number, since it is larger than the sum of its proper divisors (2277704613).
5225322219 is a wasteful number, since it uses less digits than its factorization.
5225322219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133982637.
The product of its digits is 21600, while the sum is 33.
The square root of 5225322219 is about 72286.3902750718. The cubic root of 5225322219 is about 1735.2858500250.
The spelling of 5225322219 in words is "five billion, two hundred twenty-five million, three hundred twenty-two thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •