Base | Representation |
---|---|
bin | 1011111100011… |
… | …10000000000000 |
3 | 20222112111120000 |
4 | 11332032000000 |
5 | 201122240402 |
6 | 13535320000 |
7 | 2324440434 |
oct | 576160000 |
9 | 228474500 |
10 | 100196352 |
11 | 51616003 |
12 | 29680000 |
13 | 179b1ca9 |
14 | d4429c4 |
15 | 8be2c1c |
hex | 5f8e000 |
100196352 has 140 divisors (see below), whose sum is σ = 301316136. Its totient is φ = 33177600.
The previous prime is 100196323. The next prime is 100196357. The reversal of 100196352 is 253691001.
100196352 is a `hidden beast` number, since 10 + 0 + 19 + 635 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100196357) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 663477 + ... + 663627.
Almost surely, 2100196352 is an apocalyptic number.
100196352 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 100196352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150658068).
100196352 is an abundant number, since it is smaller than the sum of its proper divisors (201119784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100196352 is an frugal number, since it uses more digits than its factorization.
100196352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189 (or 156 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 100196352 is about 10009.8127854621. The cubic root of 100196352 is about 464.4624798255.
The spelling of 100196352 in words is "one hundred million, one hundred ninety-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •