Base | Representation |
---|---|
bin | 111100100001000010010110… |
… | …110010011011011110010111 |
3 | 1021220100222120120222100122211 |
4 | 330201002112302123132113 |
5 | 234341122433134410123 |
6 | 2342021010154334251 |
7 | 110026632006566032 |
oct | 7441022662333627 |
9 | 1256328516870584 |
10 | 266153063200663 |
11 | 77893975642a51 |
12 | 25a262b642a387 |
13 | b56818425b882 |
14 | 49a1c3c676019 |
15 | 20b83ba58440d |
hex | f21096c9b797 |
266153063200663 has 8 divisors (see below), whose sum is σ = 271816195343040. Its totient is φ = 260489943600480.
The previous prime is 266153063200649. The next prime is 266153063200699. The reversal of 266153063200663 is 366002360351662.
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 266153063200663 - 221 = 266153061103511 is a prime.
It is a super-2 number, since 2×2661530632006632 (a number of 30 digits) 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 (266153063203663) 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, 48819453 + ... + 53996713.
It is an arithmetic number, because the mean of its divisors is an integer number (33977024417880).
Almost surely, 2266153063200663 is an apocalyptic number.
266153063200663 is a deficient number, since it is larger than the sum of its proper divisors (5663132142377).
266153063200663 is a wasteful number, since it uses less digits than its factorization.
266153063200663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6271097.
The product of its (nonzero) digits is 4199040, while the sum is 49.
The spelling of 266153063200663 in words is "two hundred sixty-six trillion, one hundred fifty-three billion, sixty-three million, two hundred thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •