Base | Representation |
---|---|
bin | 100010100100000010100… |
… | …1011111100000011111010 |
3 | 121211010102000201212221221 |
4 | 1011020011023330003322 |
5 | 1110312124114020200 |
6 | 14034133421422254 |
7 | 1000125243650524 |
oct | 105100513740372 |
9 | 17733360655857 |
10 | 4750320845050 |
11 | 1571666304a10 |
12 | 648788a0a98a |
13 | 285c51621121 |
14 | 125cb9812a14 |
15 | 83877b8291a |
hex | 452052fc0fa |
4750320845050 has 48 divisors (see below), whose sum is σ = 9640172801952. Its totient is φ = 1727149262400.
The previous prime is 4750320845029. The next prime is 4750320845051. The reversal of 4750320845050 is 505480230574.
It is a super-2 number, since 2×47503208450502 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4750320844988 and 4750320845006.
It is not an unprimeable number, because it can be changed into a prime (4750320845051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3383629 + ... + 4577071.
It is an arithmetic number, because the mean of its divisors is an integer number (200836933374).
Almost surely, 24750320845050 is an apocalyptic number.
4750320845050 is an abundant number, since it is smaller than the sum of its proper divisors (4889851956902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4750320845050 is a wasteful number, since it uses less digits than its factorization.
4750320845050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1200703 (or 1200698 counting only the distinct ones).
The product of its (nonzero) digits is 672000, while the sum is 43.
The spelling of 4750320845050 in words is "four trillion, seven hundred fifty billion, three hundred twenty million, eight hundred forty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •