Base | Representation |
---|---|
bin | 10100100100001001… |
… | …10001010101111100 |
3 | 1001111102221120122100 |
4 | 22102010301111330 |
5 | 140102402040222 |
6 | 5023315345100 |
7 | 540412023441 |
oct | 122204612574 |
9 | 31442846570 |
10 | 11040658812 |
11 | 4756189417 |
12 | 21815b2190 |
13 | 106c492011 |
14 | 76a4559c8 |
15 | 4494214ac |
hex | 29213157c |
11040658812 has 36 divisors (see below), whose sum is σ = 29121739920. Its totient is φ = 3520209792.
The previous prime is 11040658793. The next prime is 11040658843. The reversal of 11040658812 is 21885604011.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×110406588122 (a number of 21 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6666237 + ... + 6667892.
It is an arithmetic number, because the mean of its divisors is an integer number (808937220).
Almost surely, 211040658812 is an apocalyptic number.
11040658812 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11040658812 is an abundant number, since it is smaller than the sum of its proper divisors (18081081108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11040658812 is a wasteful number, since it uses less digits than its factorization.
11040658812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13334162 (or 13334157 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 36.
The spelling of 11040658812 in words is "eleven billion, forty million, six hundred fifty-eight thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •