Base | Representation |
---|---|
bin | 10111011000111… |
… | …10111101001000 |
3 | 111200012112012201 |
4 | 23230132331020 |
5 | 400212214004 |
6 | 31245245544 |
7 | 4601522200 |
oct | 1354367510 |
9 | 450175181 |
10 | 196210504 |
11 | a0834946 |
12 | 558638b4 |
13 | 3185b4b9 |
14 | 1c0b7400 |
15 | 1235b6a4 |
hex | bb1ef48 |
196210504 has 48 divisors (see below), whose sum is σ = 429770880. Its totient is φ = 83734560.
The previous prime is 196210489. The next prime is 196210507. The reversal of 196210504 is 405012691.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (196210507) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 105309 + ... + 107155.
It is an arithmetic number, because the mean of its divisors is an integer number (8953560).
Almost surely, 2196210504 is an apocalyptic number.
196210504 is a gapful number since it is divisible by the number (14) 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 196210504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214885440).
196210504 is an abundant number, since it is smaller than the sum of its proper divisors (233560376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196210504 is a wasteful number, since it uses less digits than its factorization.
196210504 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2138 (or 2127 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 28.
The square root of 196210504 is about 14007.5159825003. The cubic root of 196210504 is about 581.0864534823.
The spelling of 196210504 in words is "one hundred ninety-six million, two hundred ten thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •