Base | Representation |
---|---|
bin | 100001110100111… |
… | …1010100101010000 |
3 | 2221002211002102110 |
4 | 1003221322211100 |
5 | 4311033430303 |
6 | 304344145320 |
7 | 40061601462 |
oct | 10351724520 |
9 | 2832732373 |
10 | 1135061328 |
11 | 532792415 |
12 | 278168240 |
13 | 15120862b |
14 | aaa68132 |
15 | 699ae703 |
hex | 43a7a950 |
1135061328 has 40 divisors (see below), whose sum is σ = 2938180000. Its totient is φ = 377587584.
The previous prime is 1135061297. The next prime is 1135061359. The reversal of 1135061328 is 8231605311.
It is an interprime number because it is at equal distance from previous prime (1135061297) and next prime (1135061359).
It is a super-2 number, since 2×11350613282 = 2576728436642247168, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1135061295 and 1135061304.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 258 + ... + 47646.
It is an arithmetic number, because the mean of its divisors is an integer number (73454500).
Almost surely, 21135061328 is an apocalyptic number.
It is an amenable number.
1135061328 is an abundant number, since it is smaller than the sum of its proper divisors (1803118672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1135061328 is a wasteful number, since it uses less digits than its factorization.
1135061328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47899 (or 47893 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
The square root of 1135061328 is about 33690.6712310693. The cubic root of 1135061328 is about 1043.1332186932.
Adding to 1135061328 its reverse (8231605311), we get a palindrome (9366666639).
The spelling of 1135061328 in words is "one billion, one hundred thirty-five million, sixty-one thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •