Base | Representation |
---|---|
bin | 1001111100001110… |
… | …1000101010000011 |
3 | 20212222022101101211 |
4 | 2133003220222003 |
5 | 20431120432212 |
6 | 1120443510551 |
7 | 123062063512 |
oct | 23703505203 |
9 | 6788271354 |
10 | 2668530307 |
11 | 114a352353 |
12 | 625828457 |
13 | 336b18821 |
14 | 1b45a0679 |
15 | 10941a9a7 |
hex | 9f0e8a83 |
2668530307 has 4 divisors (see below), whose sum is σ = 2825502696. Its totient is φ = 2511557920.
The previous prime is 2668530301. The next prime is 2668530329. The reversal of 2668530307 is 7030358662.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2668530307 - 215 = 2668497539 is a prime.
It is a super-3 number, since 3×26685303073 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2668530307.
It is not an unprimeable number, because it can be changed into a prime (2668530301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78486169 + ... + 78486202.
It is an arithmetic number, because the mean of its divisors is an integer number (706375674).
Almost surely, 22668530307 is an apocalyptic number.
2668530307 is a deficient number, since it is larger than the sum of its proper divisors (156972389).
2668530307 is a wasteful number, since it uses less digits than its factorization.
2668530307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156972388.
The product of its (nonzero) digits is 181440, while the sum is 40.
The square root of 2668530307 is about 51657.8194177803. The cubic root of 2668530307 is about 1387.0455174849.
Adding to 2668530307 its reverse (7030358662), we get a palindrome (9698888969).
The spelling of 2668530307 in words is "two billion, six hundred sixty-eight million, five hundred thirty thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •