Base | Representation |
---|---|
bin | 100001110101101… |
… | …0000001101010100 |
3 | 2221010110220112020 |
4 | 1003223100031110 |
5 | 4311131141202 |
6 | 304355453140 |
7 | 40064562135 |
oct | 10353201524 |
9 | 2833426466 |
10 | 1135412052 |
11 | 532a01975 |
12 | 2782b71b0 |
13 | 1512cc168 |
14 | aab19c8c |
15 | 69a2d5bc |
hex | 43ad0354 |
1135412052 has 24 divisors (see below), whose sum is σ = 2663027136. Its totient is φ = 376508928.
The previous prime is 1135412039. The next prime is 1135412053. The reversal of 1135412052 is 2502145311.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1135412053) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 242808 + ... + 247439.
It is an arithmetic number, because the mean of its divisors is an integer number (110959464).
Almost surely, 21135412052 is an apocalyptic number.
1135412052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1135412052 is an abundant number, since it is smaller than the sum of its proper divisors (1527615084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1135412052 is a wasteful number, since it uses less digits than its factorization.
1135412052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490447 (or 490445 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 1135412052 is about 33695.8758900848. The cubic root of 1135412052 is about 1043.2406473025.
Adding to 1135412052 its reverse (2502145311), we get a palindrome (3637557363).
The spelling of 1135412052 in words is "one billion, one hundred thirty-five million, four hundred twelve thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •