Base | Representation |
---|---|
bin | 111100101000010100011000… |
… | …110110111000011010101001 |
3 | 1021222010211012012212110210020 |
4 | 330220110120312320122221 |
5 | 234422322242133042301 |
6 | 2343042524213111053 |
7 | 110111035234113156 |
oct | 7450243066703251 |
9 | 1258124165773706 |
10 | 266653461612201 |
11 | 77a67109490984 |
12 | 25aa7288928489 |
13 | b5a340cab2c01 |
14 | 49bc14c76922d |
15 | 20c6406165436 |
hex | f28518db86a9 |
266653461612201 has 16 divisors (see below), whose sum is σ = 363809403545280. Its totient is φ = 173633318187840.
The previous prime is 266653461612173. The next prime is 266653461612253. The reversal of 266653461612201 is 102216164356662.
It is not a de Polignac number, because 266653461612201 - 217 = 266653461481129 is a prime.
It is a super-3 number, since 3×2666534616122013 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (266653461612301) 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 15 ways as a sum of consecutive naturals, for example, 6257071 + ... + 23926091.
It is an arithmetic number, because the mean of its divisors is an integer number (22738087721580).
Almost surely, 2266653461612201 is an apocalyptic number.
It is an amenable number.
266653461612201 is a deficient number, since it is larger than the sum of its proper divisors (97155941933079).
266653461612201 is a wasteful number, since it uses less digits than its factorization.
266653461612201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17786056.
The product of its (nonzero) digits is 3732480, while the sum is 51.
The spelling of 266653461612201 in words is "two hundred sixty-six trillion, six hundred fifty-three billion, four hundred sixty-one million, six hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •