Base | Representation |
---|---|
bin | 110000101000100001… |
… | …001110000100011001 |
3 | 11222210021000121100002 |
4 | 300220201032010121 |
5 | 1323421131421234 |
6 | 35553403022345 |
7 | 3526021421003 |
oct | 605041160431 |
9 | 158707017302 |
10 | 52219404569 |
11 | 20167546602 |
12 | a15420a9b5 |
13 | 4c02806777 |
14 | 27553bd373 |
15 | 155964627e |
hex | c2884e119 |
52219404569 has 8 divisors (see below), whose sum is σ = 53142855528. Its totient is φ = 51303813120.
The previous prime is 52219404553. The next prime is 52219404617. The reversal of 52219404569 is 96540491225.
It can be written as a sum of positive squares in 4 ways, for example, as 8730472969 + 43488931600 = 93437^2 + 208540^2 .
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 52219404569 - 24 = 52219404553 is a prime.
It is a super-2 number, since 2×522194045692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52219404529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1951472 + ... + 1978049.
It is an arithmetic number, because the mean of its divisors is an integer number (6642856941).
Almost surely, 252219404569 is an apocalyptic number.
It is an amenable number.
52219404569 is a deficient number, since it is larger than the sum of its proper divisors (923450959).
52219404569 is a wasteful number, since it uses less digits than its factorization.
52219404569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3929755.
The product of its (nonzero) digits is 777600, while the sum is 47.
The spelling of 52219404569 in words is "fifty-two billion, two hundred nineteen million, four hundred four thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •