Base | Representation |
---|---|
bin | 10111011100111… |
… | …01010011110000 |
3 | 111201011211011000 |
4 | 23232131103300 |
5 | 400330244143 |
6 | 31304322000 |
7 | 4606106106 |
oct | 1356352360 |
9 | 451154130 |
10 | 196728048 |
11 | a1058770 |
12 | 55a73300 |
13 | 319acc3a |
14 | 1c1adc76 |
15 | 1240ebd3 |
hex | bb9d4f0 |
196728048 has 80 divisors (see below), whose sum is σ = 616032000. Its totient is φ = 59613120.
The previous prime is 196728023. The next prime is 196728073. The reversal of 196728048 is 840827691.
It is an interprime number because it is at equal distance from previous prime (196728023) and next prime (196728073).
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 196727994 and 196728012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15948 + ... + 25451.
It is an arithmetic number, because the mean of its divisors is an integer number (7700400).
Almost surely, 2196728048 is an apocalyptic number.
196728048 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
196728048 is an abundant number, since it is smaller than the sum of its proper divisors (419303952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196728048 is a wasteful number, since it uses less digits than its factorization.
196728048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41427 (or 41415 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 45.
The square root of 196728048 is about 14025.9776129866. The cubic root of 196728048 is about 581.5969150693.
The spelling of 196728048 in words is "one hundred ninety-six million, seven hundred twenty-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •