Base | Representation |
---|---|
bin | 100110000100011100010… |
… | …1000101101001110101101 |
3 | 200112012021102200202212012 |
4 | 1030020320220231032231 |
5 | 1141211041403033040 |
6 | 15043352052451005 |
7 | 1050005204160434 |
oct | 114107050551655 |
9 | 20465242622765 |
10 | 5232220361645 |
11 | 1737a76a99312 |
12 | 706058019a65 |
13 | 2bc51c788a94 |
14 | 141352b3011b |
15 | 9117e6ae865 |
hex | 4c238a2d3ad |
5232220361645 has 8 divisors (see below), whose sum is σ = 6278705287800. Its totient is φ = 4185749053440.
The previous prime is 5232220361639. The next prime is 5232220361723. The reversal of 5232220361645 is 5461630222325.
It can be written as a sum of positive squares in 4 ways, for example, as 899815399396 + 4332404962249 = 948586^2 + 2081443^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5232220361645 - 210 = 5232220360621 is a prime.
It is a super-3 number, since 3×52322203616453 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2539220 + ... + 4112429.
It is an arithmetic number, because the mean of its divisors is an integer number (784838160975).
Almost surely, 25232220361645 is an apocalyptic number.
It is an amenable number.
5232220361645 is a deficient number, since it is larger than the sum of its proper divisors (1046484926155).
5232220361645 is a wasteful number, since it uses less digits than its factorization.
5232220361645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6808975.
The product of its (nonzero) digits is 518400, while the sum is 41.
The spelling of 5232220361645 in words is "five trillion, two hundred thirty-two billion, two hundred twenty million, three hundred sixty-one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •