Base | Representation |
---|---|
bin | 10111101110000… |
… | …00101010111000 |
3 | 111212101201120202 |
4 | 23313000222320 |
5 | 401414020130 |
6 | 31424341332 |
7 | 4634134403 |
oct | 1367005270 |
9 | 455351522 |
10 | 198970040 |
11 | a234a155 |
12 | 56774848 |
13 | 322b6569 |
14 | 1c5d4d3a |
15 | 12704145 |
hex | bdc0ab8 |
198970040 has 64 divisors (see below), whose sum is σ = 476474400. Its totient is φ = 74518528.
The previous prime is 198970039. The next prime is 198970063. The reversal of 198970040 is 40079891.
198970040 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 198969976 and 198970003.
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, 153716 + ... + 155004.
Almost surely, 2198970040 is an apocalyptic number.
198970040 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 198970040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (238237200).
198970040 is an abundant number, since it is smaller than the sum of its proper divisors (277504360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
198970040 is a wasteful number, since it uses less digits than its factorization.
198970040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1544 (or 1540 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 38.
The square root of 198970040 is about 14105.6740356496. The cubic root of 198970040 is about 583.7979456758.
The spelling of 198970040 in words is "one hundred ninety-eight million, nine hundred seventy thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •