Base | Representation |
---|---|
bin | 1111100111100100010… |
… | …1101110000000100101 |
3 | 221122120122111121212021 |
4 | 3321321011232000211 |
5 | 13344004243432121 |
6 | 323133030223141 |
7 | 25246131146332 |
oct | 3717105560045 |
9 | 848518447767 |
10 | 268319514661 |
11 | a3880409810 |
12 | 440037b4ab1 |
13 | 1c3c15607b3 |
14 | cdb5851989 |
15 | 6ea6288641 |
hex | 3e7916e025 |
268319514661 has 16 divisors (see below), whose sum is σ = 308249948160. Its totient is φ = 230989693680.
The previous prime is 268319514649. The next prime is 268319514679. The reversal of 268319514661 is 166415913862.
It is a happy number.
268319514661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 268319514661 - 211 = 268319512613 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 268319514599 and 268319514608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (268319514641) 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 15 ways as a sum of consecutive naturals, for example, 217020 + ... + 764026.
It is an arithmetic number, because the mean of its divisors is an integer number (19265621760).
Almost surely, 2268319514661 is an apocalyptic number.
It is an amenable number.
268319514661 is a deficient number, since it is larger than the sum of its proper divisors (39930433499).
268319514661 is a wasteful number, since it uses less digits than its factorization.
268319514661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549384.
The product of its digits is 1866240, while the sum is 52.
The spelling of 268319514661 in words is "two hundred sixty-eight billion, three hundred nineteen million, five hundred fourteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •