Base | Representation |
---|---|
bin | 1001111100001001… |
… | …1001110110010001 |
3 | 20212221200222121012 |
4 | 2133002121312101 |
5 | 20431030120010 |
6 | 1120432540305 |
7 | 123056250425 |
oct | 23702316621 |
9 | 6787628535 |
10 | 2668207505 |
11 | 114a151877 |
12 | 6256b1695 |
13 | 336a34912 |
14 | 1b4518b85 |
15 | 1093a5005 |
hex | 9f099d91 |
2668207505 has 8 divisors (see below), whose sum is σ = 3202218600. Its totient is φ = 2134319616.
The previous prime is 2668207501. The next prime is 2668207561. The reversal of 2668207505 is 5057028662.
2668207505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 419266576 + 2248940929 = 20476^2 + 47423^2 .
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 2668207505 - 22 = 2668207501 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2668207501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26561 + ... + 77729.
It is an arithmetic number, because the mean of its divisors is an integer number (400277325).
Almost surely, 22668207505 is an apocalyptic number.
It is an amenable number.
2668207505 is a deficient number, since it is larger than the sum of its proper divisors (534011095).
2668207505 is a wasteful number, since it uses less digits than its factorization.
2668207505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61603.
The product of its (nonzero) digits is 201600, while the sum is 41.
The square root of 2668207505 is about 51654.6948979471. The cubic root of 2668207505 is about 1386.9895866827.
The spelling of 2668207505 in words is "two billion, six hundred sixty-eight million, two hundred seven thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •