Base | Representation |
---|---|
bin | 10100011011101011… |
… | …00100010001110000 |
3 | 1001022111011121021020 |
4 | 22031311210101300 |
5 | 134431202024042 |
6 | 5012255455440 |
7 | 535556520642 |
oct | 121565442160 |
9 | 31274147236 |
10 | 10969564272 |
11 | 471a03aaa7 |
12 | 2161827580 |
13 | 105a82c244 |
14 | 760c2a892 |
15 | 44307b3ec |
hex | 28dd64470 |
10969564272 has 160 divisors (see below), whose sum is σ = 31098961920. Its totient is φ = 3318900480.
The previous prime is 10969564237. The next prime is 10969564301. The reversal of 10969564272 is 27246596901.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2910133 + ... + 2913899.
It is an arithmetic number, because the mean of its divisors is an integer number (194368512).
Almost surely, 210969564272 is an apocalyptic number.
10969564272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10969564272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15549480960).
10969564272 is an abundant number, since it is smaller than the sum of its proper divisors (20129397648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10969564272 is a wasteful number, since it uses less digits than its factorization.
10969564272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3931 (or 3925 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 51.
The spelling of 10969564272 in words is "ten billion, nine hundred sixty-nine million, five hundred sixty-four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •