Base | Representation |
---|---|
bin | 1111100001010000101… |
… | …1000110010011100001 |
3 | 221111012122122210221211 |
4 | 3320110023012103201 |
5 | 13332022331113311 |
6 | 322253025350121 |
7 | 25156152141121 |
oct | 3702413062341 |
9 | 844178583854 |
10 | 266626426081 |
11 | a3091737254 |
12 | 43810798341 |
13 | 1c1b1864032 |
14 | cc94a48c81 |
15 | 6e077ec821 |
hex | 3e142c64e1 |
266626426081 has 4 divisors (see below), whose sum is σ = 266629676464. Its totient is φ = 266623175700.
The previous prime is 266626426063. The next prime is 266626426111. The reversal of 266626426081 is 180624626662.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-266626426081 is a prime.
It is a super-2 number, since 2×2666264260812 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (266626426481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1498875 + ... + 1667296.
It is an arithmetic number, because the mean of its divisors is an integer number (66657419116).
Almost surely, 2266626426081 is an apocalyptic number.
It is an amenable number.
266626426081 is a deficient number, since it is larger than the sum of its proper divisors (3250383).
266626426081 is an equidigital number, since it uses as much as digits as its factorization.
266626426081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3250382.
The product of its (nonzero) digits is 1990656, while the sum is 49.
The spelling of 266626426081 in words is "two hundred sixty-six billion, six hundred twenty-six million, four hundred twenty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •