Base | Representation |
---|---|
bin | 11111111100110… |
… | …01001100101001 |
3 | 200200022112121102 |
4 | 33332121030221 |
5 | 1022102430002 |
6 | 42332251145 |
7 | 6433041011 |
oct | 1776311451 |
9 | 620275542 |
10 | 268014377 |
11 | 128318194 |
12 | 75910ab5 |
13 | 436ac0b7 |
14 | 27848c41 |
15 | 187e1a02 |
hex | ff99329 |
268014377 has 8 divisors (see below), whose sum is σ = 280585536. Its totient is φ = 255519792.
The previous prime is 268014371. The next prime is 268014389. The reversal of 268014377 is 773410862.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-268014377 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 268014377.
It is not an unprimeable number, because it can be changed into a prime (268014371) 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 7 ways as a sum of consecutive naturals, for example, 11918 + ... + 26039.
It is an arithmetic number, because the mean of its divisors is an integer number (35073192).
Almost surely, 2268014377 is an apocalyptic number.
It is an amenable number.
268014377 is a deficient number, since it is larger than the sum of its proper divisors (12571159).
268014377 is a wasteful number, since it uses less digits than its factorization.
268014377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38287.
The product of its (nonzero) digits is 56448, while the sum is 38.
The square root of 268014377 is about 16371.1446453814. The cubic root of 268014377 is about 644.7421014900.
It can be divided in two parts, 26 and 8014377, that multiplied together give a palindrome (208373802).
The spelling of 268014377 in words is "two hundred sixty-eight million, fourteen thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •