Base | Representation |
---|---|
bin | 111100010010100110100010… |
… | …1010100111111101011100110 |
3 | 2120112201022102102111210211020 |
4 | 1320211031011110333223212 |
5 | 1024002244432000131342 |
6 | 5115522402304552010 |
7 | 216463342506401403 |
oct | 17045150524775346 |
9 | 2515638372453736 |
10 | 530322250005222 |
11 | 143a82448723394 |
12 | 4b590008622606 |
13 | 199bb2344c86ac |
14 | 94d5a3b9a72aa |
15 | 4149d733ea0ec |
hex | 1e2534553fae6 |
530322250005222 has 8 divisors (see below), whose sum is σ = 1060644500010456. Its totient is φ = 176774083335072.
The previous prime is 530322250005209. The next prime is 530322250005349. The reversal of 530322250005222 is 222500052223035.
It is a sphenic number, since it is the product of 3 distinct primes.
530322250005222 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44193520833763 + ... + 44193520833774.
It is an arithmetic number, because the mean of its divisors is an integer number (132580562501307).
Almost surely, 2530322250005222 is an apocalyptic number.
530322250005222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530322250005222 is a wasteful number, since it uses less digits than its factorization.
530322250005222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88387041667542.
The product of its (nonzero) digits is 72000, while the sum is 33.
The spelling of 530322250005222 in words is "five hundred thirty trillion, three hundred twenty-two billion, two hundred fifty million, five thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •