Base | Representation |
---|---|
bin | 100010010110000001111… |
… | …1001011101010001010010 |
3 | 121201020202020212202200002 |
4 | 1010230003321131101102 |
5 | 1104314020004431200 |
6 | 14012240141530002 |
7 | 665011544561165 |
oct | 104540371352122 |
9 | 17636666782602 |
10 | 4720234452050 |
11 | 155a927323607 |
12 | 642990b73902 |
13 | 28316839ab10 |
14 | 124663b19adc |
15 | 82bb6690bd5 |
hex | 44b03e5d452 |
4720234452050 has 48 divisors (see below), whose sum is σ = 9457637688072. Its totient is φ = 1742368243200.
The previous prime is 4720234452029. The next prime is 4720234452053. The reversal of 4720234452050 is 502544320274.
It can be written as a sum of positive squares in 12 ways, for example, as 1798551892201 + 2921682559849 = 1341101^2 + 1709293^2 .
It is a super-2 number, since 2×47202344520502 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4720234451995 and 4720234452013.
It is not an unprimeable number, because it can be changed into a prime (4720234452053) 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, 1313702 + ... + 3341598.
Almost surely, 24720234452050 is an apocalyptic number.
4720234452050 is an abundant number, since it is smaller than the sum of its proper divisors (4737403236022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4720234452050 is a wasteful number, since it uses less digits than its factorization.
4720234452050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2031503 (or 2031498 counting only the distinct ones).
The product of its (nonzero) digits is 268800, while the sum is 38.
The spelling of 4720234452050 in words is "four trillion, seven hundred twenty billion, two hundred thirty-four million, four hundred fifty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •