Base | Representation |
---|---|
bin | 111100011111000010000111… |
… | …000010111001110010100101 |
3 | 1021212212211010211100120220110 |
4 | 330133002013002321302211 |
5 | 234331343424143131323 |
6 | 2341433434103523233 |
7 | 110013655416032241 |
oct | 7437020702716245 |
9 | 1255784124316813 |
10 | 266015360130213 |
11 | 77840531872aa1 |
12 | 25a03685a59519 |
13 | b5581aa5082b5 |
14 | 49992d8117421 |
15 | 20b4a0b329793 |
hex | f1f0870b9ca5 |
266015360130213 has 8 divisors (see below), whose sum is σ = 359545874879488. Its totient is φ = 174914209400544.
The previous prime is 266015360130167. The next prime is 266015360130229. The reversal of 266015360130213 is 312031063510662.
266015360130213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 266015360130213 - 28 = 266015360129957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (266015360130713) 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, 607341004645 + ... + 607341005082.
It is an arithmetic number, because the mean of its divisors is an integer number (44943234359936).
Almost surely, 2266015360130213 is an apocalyptic number.
It is an amenable number.
266015360130213 is a deficient number, since it is larger than the sum of its proper divisors (93530514749275).
266015360130213 is a wasteful number, since it uses less digits than its factorization.
266015360130213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1214682009803.
The product of its (nonzero) digits is 116640, while the sum is 39.
The spelling of 266015360130213 in words is "two hundred sixty-six trillion, fifteen billion, three hundred sixty million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •