Base | Representation |
---|---|
bin | 10111101100111… |
… | …01100111010100 |
3 | 111212010102121200 |
4 | 23312131213110 |
5 | 401344421302 |
6 | 31421312500 |
7 | 4632665646 |
oct | 1366354724 |
9 | 455112550 |
10 | 198826452 |
11 | a2261290 |
12 | 56705730 |
13 | 322660b6 |
14 | 1c598896 |
15 | 126c681c |
hex | bd9d9d4 |
198826452 has 36 divisors (see below), whose sum is σ = 548280096. Its totient is φ = 60250320.
The previous prime is 198826427. The next prime is 198826457. The reversal of 198826452 is 254628891.
198826452 is a `hidden beast` number, since 198 + 8 + 2 + 6 + 452 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a junction number, because it is equal to n+sod(n) for n = 198826398 and 198826407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (198826457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 250648 + ... + 251439.
Almost surely, 2198826452 is an apocalyptic number.
198826452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
198826452 is an abundant number, since it is smaller than the sum of its proper divisors (349453644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
198826452 is a wasteful number, since it uses less digits than its factorization.
198826452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502108 (or 502103 counting only the distinct ones).
The product of its digits is 276480, while the sum is 45.
The square root of 198826452 is about 14100.5833921863. The cubic root of 198826452 is about 583.6574780420.
The spelling of 198826452 in words is "one hundred ninety-eight million, eight hundred twenty-six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •