Base | Representation |
---|---|
bin | 100101110011110… |
… | …0101100011001101 |
3 | 10021102020001011201 |
4 | 1023213211203031 |
5 | 10044234343441 |
6 | 325515545501 |
7 | 43303335223 |
oct | 11347454315 |
9 | 3242201151 |
10 | 1268668621 |
11 | 5a1148570 |
12 | 2b4a5b291 |
13 | 172ab7cbc |
14 | c06c6b13 |
15 | 765a1c31 |
hex | 4b9e58cd |
1268668621 has 8 divisors (see below), whose sum is σ = 1385532288. Its totient is φ = 1152060000.
The previous prime is 1268668607. The next prime is 1268668637.
1268668621 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1268668621 - 211 = 1268666573 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1268668601) 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, 53280 + ... + 73321.
It is an arithmetic number, because the mean of its divisors is an integer number (173191536).
Almost surely, 21268668621 is an apocalyptic number.
1268668621 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1268668621 is a deficient number, since it is larger than the sum of its proper divisors (116863667).
1268668621 is a wasteful number, since it uses less digits than its factorization.
1268668621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127523.
The product of its digits is 331776, while the sum is 46.
The square root of 1268668621 is about 35618.3747664039. The cubic root of 1268668621 is about 1082.5535771316.
The spelling of 1268668621 in words is "one billion, two hundred sixty-eight million, six hundred sixty-eight thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •