Base | Representation |
---|---|
bin | 1111101001001011110… |
… | …0100101111100011101 |
3 | 221200200212210201120011 |
4 | 3322102330211330131 |
5 | 13400401323024244 |
6 | 323244044323221 |
7 | 25262646420046 |
oct | 3722274457435 |
9 | 850625721504 |
10 | 268753329949 |
11 | a3a83280645 |
12 | 44104b43511 |
13 | 1c4603b1830 |
14 | d0172d98cd |
15 | 6ece3cb434 |
hex | 3e92f25f1d |
268753329949 has 4 divisors (see below), whose sum is σ = 289426663036. Its totient is φ = 248079996864.
The previous prime is 268753329931. The next prime is 268753330007. The reversal of 268753329949 is 949923357862.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 64884825625 + 203868504324 = 254725^2 + 451518^2 .
It is a cyclic number.
It is not a de Polignac number, because 268753329949 - 25 = 268753329917 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 (268783329949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10336666524 + ... + 10336666549.
It is an arithmetic number, because the mean of its divisors is an integer number (72356665759).
Almost surely, 2268753329949 is an apocalyptic number.
It is an amenable number.
268753329949 is a deficient number, since it is larger than the sum of its proper divisors (20673333087).
268753329949 is a wasteful number, since it uses less digits than its factorization.
268753329949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20673333086.
The product of its digits is 176359680, while the sum is 67.
The spelling of 268753329949 in words is "two hundred sixty-eight billion, seven hundred fifty-three million, three hundred twenty-nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •