Base | Representation |
---|---|
bin | 10100000010110100… |
… | …10100010010000000 |
3 | 1000202221220020012010 |
4 | 22001122110102000 |
5 | 134014320004042 |
6 | 4535451332520 |
7 | 530445535455 |
oct | 120132242200 |
9 | 30687806163 |
10 | 10761094272 |
11 | 46223a2445 |
12 | 2103a51140 |
13 | 102659a906 |
14 | 74128182c |
15 | 42eaec59c |
hex | 281694480 |
10761094272 has 64 divisors (see below), whose sum is σ = 29826970560. Its totient is φ = 3431070720.
The previous prime is 10761094247. The next prime is 10761094273. The reversal of 10761094272 is 27249016701.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×107610942722 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10761094272.
It is not an unprimeable number, because it can be changed into a prime (10761094273) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 600379 + ... + 618042.
It is an arithmetic number, because the mean of its divisors is an integer number (466046415).
Almost surely, 210761094272 is an apocalyptic number.
10761094272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10761094272 is an abundant number, since it is smaller than the sum of its proper divisors (19065876288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10761094272 is a wasteful number, since it uses less digits than its factorization.
10761094272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1218461 (or 1218449 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 39.
The spelling of 10761094272 in words is "ten billion, seven hundred sixty-one million, ninety-four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •