Base | Representation |
---|---|
bin | 11111111110001… |
… | …01010110000011 |
3 | 200200122201122200 |
4 | 33333011112003 |
5 | 1022124221303 |
6 | 42340204243 |
7 | 6434423133 |
oct | 1777052603 |
9 | 620581580 |
10 | 268195203 |
11 | 128431031 |
12 | 75999683 |
13 | 437434b3 |
14 | 27894ac3 |
15 | 1882a3a3 |
hex | ffc5583 |
268195203 has 72 divisors (see below), whose sum is σ = 442679328. Its totient is φ = 156017664.
The previous prime is 268195201. The next prime is 268195237. The reversal of 268195203 is 302591862.
268195203 is a `hidden beast` number, since 268 + 195 + 203 = 666.
It is not a de Polignac number, because 268195203 - 21 = 268195201 is a prime.
It is a super-2 number, since 2×2681952032 = 143857333824422418, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (268195201) 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 71 ways as a sum of consecutive naturals, for example, 2764851 + ... + 2764947.
It is an arithmetic number, because the mean of its divisors is an integer number (6148324).
Almost surely, 2268195203 is an apocalyptic number.
268195203 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
268195203 is a deficient number, since it is larger than the sum of its proper divisors (174484125).
268195203 is a wasteful number, since it uses less digits than its factorization.
268195203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201 (or 179 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 268195203 is about 16376.6664190244. Note that the first 3 decimals coincide. The cubic root of 268195203 is about 644.8870687446.
The spelling of 268195203 in words is "two hundred sixty-eight million, one hundred ninety-five thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •