Base | Representation |
---|---|
bin | 11111111111011… |
… | …00001010100111 |
3 | 200200221210210000 |
4 | 33333230022213 |
5 | 1022144313330 |
6 | 42343432343 |
7 | 6435654543 |
oct | 1777541247 |
9 | 620853700 |
10 | 268354215 |
11 | 12852a548 |
12 | 75a556b3 |
13 | 4379a99c |
14 | 278d6a23 |
15 | 1885c560 |
hex | ffec2a7 |
268354215 has 40 divisors (see below), whose sum is σ = 484387200. Its totient is φ = 142129728.
The previous prime is 268354213. The next prime is 268354217. The reversal of 268354215 is 512453862.
268354215 is a `hidden beast` number, since 26 + 83 + 542 + 15 = 666.
It is an interprime number because it is at equal distance from previous prime (268354213) and next prime (268354217).
It is not a de Polignac number, because 268354215 - 21 = 268354213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 268354215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (268354213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 58122 + ... + 62568.
It is an arithmetic number, because the mean of its divisors is an integer number (12109680).
Almost surely, 2268354215 is an apocalyptic number.
268354215 is a deficient number, since it is larger than the sum of its proper divisors (216032985).
268354215 is a wasteful number, since it uses less digits than its factorization.
268354215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4613 (or 4604 counting only the distinct ones).
The product of its digits is 57600, while the sum is 36.
The square root of 268354215 is about 16381.5205338210. The cubic root of 268354215 is about 645.0144939956.
The spelling of 268354215 in words is "two hundred sixty-eight million, three hundred fifty-four thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •