Base | Representation |
---|---|
bin | 10111011001011… |
… | …00010001000001 |
3 | 111200022022000000 |
4 | 23230230101001 |
5 | 400220440100 |
6 | 31250350213 |
7 | 4602140145 |
oct | 1354542101 |
9 | 450268000 |
10 | 196265025 |
11 | a0871900 |
12 | 5588b369 |
13 | 3187a268 |
14 | 1c0cd225 |
15 | 1236c900 |
hex | bb2c441 |
196265025 has 126 divisors (see below), whose sum is σ = 405579510. Its totient is φ = 94089600.
The previous prime is 196265023. The next prime is 196265053. The reversal of 196265025 is 520562691.
196265025 is a `hidden beast` number, since 1 + 9 + 626 + 5 + 0 + 25 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 1411344 + 194853681 = 1188^2 + 13959^2 .
It is not a de Polignac number, because 196265025 - 21 = 196265023 is a prime.
It is not an unprimeable number, because it can be changed into a prime (196265023) by changing a digit.
It is a polite number, since it can be written in 125 ways as a sum of consecutive naturals, for example, 2205181 + ... + 2205269.
It is an arithmetic number, because the mean of its divisors is an integer number (3218885).
Almost surely, 2196265025 is an apocalyptic number.
196265025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
196265025 is an abundant number, since it is smaller than the sum of its proper divisors (209314485).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196265025 is an equidigital number, since it uses as much as digits as its factorization.
196265025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139 (or 108 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The square root of 196265025 is about 14009.4619811041. The cubic root of 196265025 is about 581.1402706496.
The spelling of 196265025 in words is "one hundred ninety-six million, two hundred sixty-five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •