Base | Representation |
---|---|
bin | 10101001011010110… |
… | …11101001000001000 |
3 | 1002100100211211111000 |
4 | 22211223131020020 |
5 | 141241102113403 |
6 | 5120105135000 |
7 | 551514502602 |
oct | 124553351010 |
9 | 32310754430 |
10 | 11369566728 |
11 | 4904907843 |
12 | 225378a460 |
13 | 10c26719a0 |
14 | 79bdd2172 |
15 | 4682407a3 |
hex | 2a5add208 |
11369566728 has 64 divisors (see below), whose sum is σ = 34011532800. Its totient is φ = 3498327360.
The previous prime is 11369566723. The next prime is 11369566763. The reversal of 11369566728 is 82766596311.
11369566728 is a `hidden beast` number, since 1 + 1 + 3 + 6 + 9 + 566 + 72 + 8 = 666.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (11369566723) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2021688 + ... + 2027303.
It is an arithmetic number, because the mean of its divisors is an integer number (531430200).
Almost surely, 211369566728 is an apocalyptic number.
11369566728 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
11369566728 is an abundant number, since it is smaller than the sum of its proper divisors (22641966072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11369566728 is a wasteful number, since it uses less digits than its factorization.
11369566728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4049019 (or 4049009 counting only the distinct ones).
The product of its digits is 3265920, while the sum is 54.
The spelling of 11369566728 in words is "eleven billion, three hundred sixty-nine million, five hundred sixty-six thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •