Base | Representation |
---|---|
bin | 100101110110100100111… |
… | …1001100011100100100111 |
3 | 200102100102100111212100022 |
4 | 1023231021321203210213 |
5 | 1140214101434021020 |
6 | 15021545332105355 |
7 | 1044602304511622 |
oct | 113551171434447 |
9 | 20370370455308 |
10 | 5202445220135 |
11 | 1726387776849 |
12 | 70032846525b |
13 | 2b9785b72957 |
14 | 13db2a4d8db9 |
15 | 904da6a0625 |
hex | 4bb49e63927 |
5202445220135 has 8 divisors (see below), whose sum is σ = 6243046862640. Its totient is φ = 4161881110464.
The previous prime is 5202445220131. The next prime is 5202445220153. The reversal of 5202445220135 is 5310225442025.
It is a happy number.
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 5202445220135 - 22 = 5202445220131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5202445220095 and 5202445220104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5202445220131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9077357 + ... + 9633446.
It is an arithmetic number, because the mean of its divisors is an integer number (780380857830).
Almost surely, 25202445220135 is an apocalyptic number.
5202445220135 is a deficient number, since it is larger than the sum of its proper divisors (1040601642505).
5202445220135 is a wasteful number, since it uses less digits than its factorization.
5202445220135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18766417.
The product of its (nonzero) digits is 96000, while the sum is 35.
The spelling of 5202445220135 in words is "five trillion, two hundred two billion, four hundred forty-five million, two hundred twenty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •