Base | Representation |
---|---|
bin | 1001111100000111… |
… | …1010110001011111 |
3 | 20212221110112000001 |
4 | 2133001322301133 |
5 | 20431012031343 |
6 | 1120430115131 |
7 | 123055210354 |
oct | 23701726137 |
9 | 6787415001 |
10 | 2668080223 |
11 | 114a075186 |
12 | 62564baa7 |
13 | 3369bb9c3 |
14 | 1b44c462b |
15 | 10937c44d |
hex | 9f07ac5f |
2668080223 has 4 divisors (see below), whose sum is σ = 2668210240. Its totient is φ = 2667950208.
The previous prime is 2668080199. The next prime is 2668080229. The reversal of 2668080223 is 3220808662.
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 2668080223 - 221 = 2665983071 is a prime.
It is a super-3 number, since 3×26680802233 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2668080229) 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 3 ways as a sum of consecutive naturals, for example, 26703 + ... + 77776.
It is an arithmetic number, because the mean of its divisors is an integer number (667052560).
Almost surely, 22668080223 is an apocalyptic number.
2668080223 is a deficient number, since it is larger than the sum of its proper divisors (130017).
2668080223 is a wasteful number, since it uses less digits than its factorization.
2668080223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130016.
The product of its (nonzero) digits is 55296, while the sum is 37.
The square root of 2668080223 is about 51653.4628364837. The cubic root of 2668080223 is about 1386.9675317244.
Adding to 2668080223 its reverse (3220808662), we get a palindrome (5888888885).
The spelling of 2668080223 in words is "two billion, six hundred sixty-eight million, eighty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •