Base | Representation |
---|---|
bin | 1101101100110110011… |
… | …01110011011100110100 |
3 | 1200000002202120022200220 |
4 | 12312123031303130310 |
5 | 30203101403203411 |
6 | 1000132340334340 |
7 | 46003521626520 |
oct | 6663315633464 |
9 | 1600082508626 |
10 | 470755522356 |
11 | 171712246609 |
12 | 7729b0a43b0 |
13 | 35513464c32 |
14 | 18adb286d80 |
15 | c3a34e7b06 |
hex | 6d9b373734 |
470755522356 has 24 divisors (see below), whose sum is σ = 1255348059840. Its totient is φ = 134501577792.
The previous prime is 470755522343. The next prime is 470755522357. The reversal of 470755522356 is 653225557074.
It is a super-2 number, since 2×4707555223562 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 470755522299 and 470755522308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (470755522357) 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, 2802116121 + ... + 2802116288.
It is an arithmetic number, because the mean of its divisors is an integer number (52306169160).
Almost surely, 2470755522356 is an apocalyptic number.
It is an amenable number.
470755522356 is an abundant number, since it is smaller than the sum of its proper divisors (784592537484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
470755522356 is a wasteful number, since it uses less digits than its factorization.
470755522356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5604232423 (or 5604232421 counting only the distinct ones).
The product of its (nonzero) digits is 8820000, while the sum is 51.
The spelling of 470755522356 in words is "four hundred seventy billion, seven hundred fifty-five million, five hundred twenty-two thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •