Base | Representation |
---|---|
bin | 10000000000101… |
… | …001100100000001 |
3 | 200201102120202011 |
4 | 100000221210001 |
5 | 1022230340242 |
6 | 42353052521 |
7 | 6441052663 |
oct | 2000514401 |
9 | 621376664 |
10 | 268605697 |
11 | 128691488 |
12 | 75b57141 |
13 | 438582a9 |
14 | 27960533 |
15 | 188abd17 |
hex | 10029901 |
268605697 has 2 divisors, whose sum is σ = 268605698. Its totient is φ = 268605696.
The previous prime is 268605691. The next prime is 268605703. The reversal of 268605697 is 796506862.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (268605691) and next prime (268605703).
It can be written as a sum of positive squares in only one way, i.e., 150209536 + 118396161 = 12256^2 + 10881^2 .
It is a cyclic number.
It is not a de Polignac number, because 268605697 - 211 = 268603649 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 268605697.
It is not a weakly prime, because it can be changed into another prime (268605691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 134302848 + 134302849.
It is an arithmetic number, because the mean of its divisors is an integer number (134302849).
Almost surely, 2268605697 is an apocalyptic number.
It is an amenable number.
268605697 is a deficient number, since it is larger than the sum of its proper divisors (1).
268605697 is an equidigital number, since it uses as much as digits as its factorization.
268605697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 49.
The square root of 268605697 is about 16389.1945195607. The cubic root of 268605697 is about 645.2159179370.
The spelling of 268605697 in words is "two hundred sixty-eight million, six hundred five thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •