Base | Representation |
---|---|
bin | 100110111001… |
… | …011000010100 |
3 | 201012000222011 |
4 | 212321120110 |
5 | 10102242000 |
6 | 1002314004 |
7 | 152445256 |
oct | 46713024 |
9 | 21160864 |
10 | 10196500 |
11 | 5834866 |
12 | 34b8904 |
13 | 2160142 |
14 | 14d5cd6 |
15 | d662ba |
hex | 9b9614 |
10196500 has 24 divisors (see below), whose sum is σ = 22270248. Its totient is φ = 4078400.
The previous prime is 10196479. The next prime is 10196503. The reversal of 10196500 is 569101.
It can be written as a sum of positive squares in 4 ways, for example, as 374544 + 9821956 = 612^2 + 3134^2 .
It is a super-2 number, since 2×101965002 = 207937224500000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10196503) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 9697 + ... + 10696.
It is an arithmetic number, because the mean of its divisors is an integer number (927927).
Almost surely, 210196500 is an apocalyptic number.
10196500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10196500 is an abundant number, since it is smaller than the sum of its proper divisors (12073748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10196500 is a wasteful number, since it uses less digits than its factorization.
10196500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20412 (or 20400 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 22.
The square root of 10196500 is about 3193.1958912663. The cubic root of 10196500 is about 216.8454802621.
The spelling of 10196500 in words is "ten million, one hundred ninety-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •