Base | Representation |
---|---|
bin | 1001111011101111… |
… | …1101111001001111 |
3 | 20212211112020222022 |
4 | 2132323331321033 |
5 | 20430112121033 |
6 | 1120332440355 |
7 | 123036022130 |
oct | 23673757117 |
9 | 6784466868 |
10 | 2666520143 |
11 | 11491aa061 |
12 | 6250190bb |
13 | 336593891 |
14 | 1b41d9c87 |
15 | 109170098 |
hex | 9eefde4f |
2666520143 has 8 divisors (see below), whose sum is σ = 3075933312. Its totient is φ = 2264227416.
The previous prime is 2666520133. The next prime is 2666520161. The reversal of 2666520143 is 3410256662.
It is a happy number.
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 2666520143 - 228 = 2398084687 is a prime.
It is a super-2 number, since 2×26665201432 = 14220659346049480898, which contains 22 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 (2666520133) 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 7 ways as a sum of consecutive naturals, for example, 1779305 + ... + 1780802.
It is an arithmetic number, because the mean of its divisors is an integer number (384491664).
Almost surely, 22666520143 is an apocalyptic number.
2666520143 is a deficient number, since it is larger than the sum of its proper divisors (409413169).
2666520143 is a wasteful number, since it uses less digits than its factorization.
2666520143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3560221.
The product of its (nonzero) digits is 51840, while the sum is 35.
The square root of 2666520143 is about 51638.3592206414. The cubic root of 2666520143 is about 1386.6971497770.
The spelling of 2666520143 in words is "two billion, six hundred sixty-six million, five hundred twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •