Base | Representation |
---|---|
bin | 10100101000000101… |
… | …10101101011110100 |
3 | 1001120202010120212200 |
4 | 22110002311223310 |
5 | 140134332103430 |
6 | 5030455544500 |
7 | 541262645205 |
oct | 122402655364 |
9 | 31522116780 |
10 | 11073706740 |
11 | 4772900858 |
12 | 219068b130 |
13 | 10762933c5 |
14 | 7709b95ac |
15 | 44c29d460 |
hex | 2940b5af4 |
11073706740 has 36 divisors (see below), whose sum is σ = 33590244324. Its totient is φ = 2952988416.
The previous prime is 11073706697. The next prime is 11073706741. The reversal of 11073706740 is 4760737011.
It can be written as a sum of positive squares in 2 ways, for example, as 5286453264 + 5787253476 = 72708^2 + 76074^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 11073706695 and 11073706704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11073706741) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30760117 + ... + 30760476.
Almost surely, 211073706740 is an apocalyptic number.
11073706740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11073706740 is an abundant number, since it is smaller than the sum of its proper divisors (22516537584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11073706740 is a wasteful number, since it uses less digits than its factorization.
11073706740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61520608 (or 61520603 counting only the distinct ones).
The product of its (nonzero) digits is 24696, while the sum is 36.
The spelling of 11073706740 in words is "eleven billion, seventy-three million, seven hundred six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •