Base | Representation |
---|---|
bin | 10011111001111011… |
… | …10000000010000100 |
3 | 1000120202112021211111 |
4 | 21330331300002010 |
5 | 133341220400100 |
6 | 4524224414404 |
7 | 525551503432 |
oct | 117475600204 |
9 | 30522467744 |
10 | 10686496900 |
11 | 4594281322 |
12 | 20a2a77404 |
13 | 1013cac661 |
14 | 7353c3d52 |
15 | 4282b46ba |
hex | 27cf70084 |
10686496900 has 144 divisors (see below), whose sum is σ = 24669671040. Its totient is φ = 4009984000.
The previous prime is 10686496879. The next prime is 10686496903. The reversal of 10686496900 is 969468601.
It is a super-2 number, since 2×106864969002 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10686496903) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 41581572 + ... + 41581828.
It is an arithmetic number, because the mean of its divisors is an integer number (171317160).
Almost surely, 210686496900 is an apocalyptic number.
10686496900 is a gapful number since it is divisible by the number (10) 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 10686496900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12334835520).
10686496900 is an abundant number, since it is smaller than the sum of its proper divisors (13983174140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10686496900 is a wasteful number, since it uses less digits than its factorization.
10686496900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 574 (or 567 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 49.
The spelling of 10686496900 in words is "ten billion, six hundred eighty-six million, four hundred ninety-six thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •