Base | Representation |
---|---|
bin | 10100010100111010… |
… | …10000101000000000 |
3 | 1001011112110202112220 |
4 | 22022131100220000 |
5 | 134322143020142 |
6 | 5002512251040 |
7 | 534300533220 |
oct | 121235205000 |
9 | 31145422486 |
10 | 10912860672 |
11 | 46a003081a |
12 | 2146840a80 |
13 | 104bb6780c |
14 | 7574aa080 |
15 | 43d0ca2ec |
hex | 28a750a00 |
10912860672 has 160 divisors (see below), whose sum is σ = 34975142400. Its totient is φ = 2953801728.
The previous prime is 10912860661. The next prime is 10912860703. The reversal of 10912860672 is 27606821901.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 177579 + ... + 230997.
It is an arithmetic number, because the mean of its divisors is an integer number (218594640).
Almost surely, 210912860672 is an apocalyptic number.
10912860672 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 10912860672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17487571200).
10912860672 is an abundant number, since it is smaller than the sum of its proper divisors (24062281728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10912860672 is an equidigital number, since it uses as much as digits as its factorization.
10912860672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53466 (or 53450 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 42.
The spelling of 10912860672 in words is "ten billion, nine hundred twelve million, eight hundred sixty thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •