Base | Representation |
---|---|
bin | 10010101100111111… |
… | …01011010101011100 |
3 | 221220210001200002201 |
4 | 21112133223111130 |
5 | 131031004013012 |
6 | 4340211101244 |
7 | 503553523120 |
oct | 112637532534 |
9 | 27823050081 |
10 | 10041079132 |
11 | 4292a22407 |
12 | 1b428a1824 |
13 | c40371256 |
14 | 6b37b7580 |
15 | 3db7c4857 |
hex | 2567eb55c |
10041079132 has 54 divisors (see below), whose sum is σ = 20830424888. Its totient is φ = 4148566464.
The previous prime is 10041079109. The next prime is 10041079141. The reversal of 10041079132 is 23197014001.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 10041079132.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 15376518 + ... + 15377170.
Almost surely, 210041079132 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10041079132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10415212444).
10041079132 is an abundant number, since it is smaller than the sum of its proper divisors (10789345756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10041079132 is an frugal number, since it uses more digits than its factorization.
10041079132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1375 (or 691 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 28.
Multiplying 10041079132 by its sum of digits (28), we get a square (281150215696 = 5302362).
10041079132 divided by its sum of digits (28) gives a square (358609969 = 189372).
The spelling of 10041079132 in words is "ten billion, forty-one million, seventy-nine thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •