Base | Representation |
---|---|
bin | 1001111100010100… |
… | …1001001100001101 |
3 | 20220000001110210100 |
4 | 2133011021030031 |
5 | 20431221110314 |
6 | 1120500201313 |
7 | 123065331342 |
oct | 23705111415 |
9 | 6800043710 |
10 | 2668925709 |
11 | 114a5a242a |
12 | 625999239 |
13 | 336c267a8 |
14 | 1b46647c9 |
15 | 109497c09 |
hex | 9f14930d |
2668925709 has 48 divisors (see below), whose sum is σ = 4101814080. Its totient is φ = 1669274880.
The previous prime is 2668925689. The next prime is 2668925719. The reversal of 2668925709 is 9075298662.
2668925709 is a `hidden beast` number, since 2 + 6 + 68 + 9 + 2 + 570 + 9 = 666.
It is a de Polignac number, because none of the positive numbers 2k-2668925709 is a prime.
It is a super-2 number, since 2×26689257092 = 14246328880322305362, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2668925719) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4740262 + ... + 4740824.
It is an arithmetic number, because the mean of its divisors is an integer number (85454460).
Almost surely, 22668925709 is an apocalyptic number.
2668925709 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
It is an amenable number.
2668925709 is a deficient number, since it is larger than the sum of its proper divisors (1432888371).
2668925709 is a wasteful number, since it uses less digits than its factorization.
2668925709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1082 (or 1079 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 54.
The square root of 2668925709 is about 51661.6464023360. The cubic root of 2668925709 is about 1387.1140212957.
The spelling of 2668925709 in words is "two billion, six hundred sixty-eight million, nine hundred twenty-five thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •