Base | Representation |
---|---|
bin | 111100011110111101000111… |
… | …110110110100010011111110 |
3 | 1021212212022022121210022121210 |
4 | 330132331013312310103332 |
5 | 234331301442241431032 |
6 | 2341431150445305250 |
7 | 110013405622316502 |
oct | 7436750766642376 |
9 | 1255768277708553 |
10 | 266010005030142 |
11 | 77839233a7805a |
12 | 25a02630565226 |
13 | b557835c29029 |
14 | 4998d4ac1c302 |
15 | 20b47e612d2cc |
hex | f1ef47db44fe |
266010005030142 has 8 divisors (see below), whose sum is σ = 532020010060296. Its totient is φ = 88670001676712.
The previous prime is 266010005030083. The next prime is 266010005030153. The reversal of 266010005030142 is 241030500010662.
It is a sphenic number, since it is the product of 3 distinct primes.
266010005030142 is an admirable number.
It is a super-2 number, since 2×2660100050301422 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22167500419173 + ... + 22167500419184.
It is an arithmetic number, because the mean of its divisors is an integer number (66502501257537).
Almost surely, 2266010005030142 is an apocalyptic number.
266010005030142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
266010005030142 is a wasteful number, since it uses less digits than its factorization.
266010005030142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44335000838362.
The product of its (nonzero) digits is 8640, while the sum is 30.
The spelling of 266010005030142 in words is "two hundred sixty-six trillion, ten billion, five million, thirty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •