Base | Representation |
---|---|
bin | 10101100011010011… |
… | …00010010000100100 |
3 | 1002212100201201021220 |
4 | 22301221202100210 |
5 | 142144004440202 |
6 | 5152041340340 |
7 | 556503456414 |
oct | 126151422044 |
9 | 32770651256 |
10 | 11570390052 |
11 | 49a8202331 |
12 | 22aaa976b0 |
13 | 1125156960 |
14 | 7ba94a644 |
15 | 47abadabc |
hex | 2b1a62424 |
11570390052 has 48 divisors (see below), whose sum is σ = 29356629120. Its totient is φ = 3525550848.
The previous prime is 11570390033. The next prime is 11570390089. The reversal of 11570390052 is 25009307511.
It is a junction number, because it is equal to n+sod(n) for n = 11570389995 and 11570390022.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 343977 + ... + 376112.
It is an arithmetic number, because the mean of its divisors is an integer number (611596440).
Almost surely, 211570390052 is an apocalyptic number.
11570390052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11570390052 is an abundant number, since it is smaller than the sum of its proper divisors (17786239068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11570390052 is a wasteful number, since it uses less digits than its factorization.
11570390052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 720212 (or 720210 counting only the distinct ones).
The product of its (nonzero) digits is 9450, while the sum is 33.
Adding to 11570390052 its reverse (25009307511), we get a palindrome (36579697563).
The spelling of 11570390052 in words is "eleven billion, five hundred seventy million, three hundred ninety thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •