Base | Representation |
---|---|
bin | 10101100011011111… |
… | …01011100100100100 |
3 | 1002212110202120011212 |
4 | 22301233223210210 |
5 | 142144413013220 |
6 | 5152140050552 |
7 | 556523246264 |
oct | 126157534444 |
9 | 32773676155 |
10 | 11572001060 |
11 | 49a9102744 |
12 | 22ab533a58 |
13 | 112559c009 |
14 | 7bac497a4 |
15 | 47adcb0c5 |
hex | 2b1beb924 |
11572001060 has 24 divisors (see below), whose sum is σ = 24551734200. Its totient is φ = 4581080064.
The previous prime is 11572001059. The next prime is 11572001069. The reversal of 11572001060 is 6010027511.
It can be written as a sum of positive squares in 4 ways, for example, as 1422647524 + 10149353536 = 37718^2 + 100744^2 .
It is a super-2 number, since 2×115720010602 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11572001069) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2980535 + ... + 2984414.
It is an arithmetic number, because the mean of its divisors is an integer number (1022988925).
Almost surely, 211572001060 is an apocalyptic number.
11572001060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11572001060 is an abundant number, since it is smaller than the sum of its proper divisors (12979733140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11572001060 is a wasteful number, since it uses less digits than its factorization.
11572001060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5965055 (or 5965053 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 23.
Adding to 11572001060 its reverse (6010027511), we get a palindrome (17582028571).
The spelling of 11572001060 in words is "eleven billion, five hundred seventy-two million, one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •