Base | Representation |
---|---|
bin | 1110111100011000… |
… | …0110000010011100 |
3 | 101100120001210202202 |
4 | 3233012012002130 |
5 | 31203401232340 |
6 | 1502013111032 |
7 | 201255634301 |
oct | 35706060234 |
9 | 11316053682 |
10 | 4011352220 |
11 | 1779338327 |
12 | 93b488478 |
13 | 4bc0978c5 |
14 | 2a0a6b0a8 |
15 | 187268c15 |
hex | ef18609c |
4011352220 has 12 divisors (see below), whose sum is σ = 8423839704. Its totient is φ = 1604540880.
The previous prime is 4011352217. The next prime is 4011352313. The reversal of 4011352220 is 222531104.
It is a Harshad number since it is a multiple of its sum of digits (20), and also a Moran number because the ratio is a prime number: 200567611 = 4011352220 / (4 + 0 + 1 + 1 + 3 + 5 + 2 + 2 + 2 + 0).
It is a junction number, because it is equal to n+sod(n) for n = 4011352192 and 4011352201.
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, 100283786 + ... + 100283825.
It is an arithmetic number, because the mean of its divisors is an integer number (701986642).
Almost surely, 24011352220 is an apocalyptic number.
It is an amenable number.
4011352220 is an abundant number, since it is smaller than the sum of its proper divisors (4412487484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4011352220 is a wasteful number, since it uses less digits than its factorization.
4011352220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200567620 (or 200567618 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 4011352220 is about 63335.2367959574. The cubic root of 4011352220 is about 1588.9013440558.
Adding to 4011352220 its reverse (222531104), we get a palindrome (4233883324).
The spelling of 4011352220 in words is "four billion, eleven million, three hundred fifty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •