Base | Representation |
---|---|
bin | 111100101000011110100111… |
… | …001111101010001111010101 |
3 | 1021222011212112100102000221201 |
4 | 330220132213033222033111 |
5 | 234423012233221010442 |
6 | 2343051541442512501 |
7 | 110111604265250233 |
oct | 7450364717521725 |
9 | 1258155470360851 |
10 | 266664440406997 |
11 | 77a70832755a06 |
12 | 25aa9431665731 |
13 | b5a446c4c46a9 |
14 | 49bc8b08b9953 |
15 | 20c6849e167b7 |
hex | f287a73ea3d5 |
266664440406997 has 8 divisors (see below), whose sum is σ = 268104353105600. Its totient is φ = 265225526612640.
The previous prime is 266664440406829. The next prime is 266664440407007. The reversal of 266664440406997 is 799604044466662.
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 266664440406997 - 227 = 266664306189269 is a prime.
It is a super-2 number, since 2×2666644404069972 (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 (266664440476997) 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, 249190704 + ... + 250258537.
It is an arithmetic number, because the mean of its divisors is an integer number (33513044138200).
Almost surely, 2266664440406997 is an apocalyptic number.
It is an amenable number.
266664440406997 is a deficient number, since it is larger than the sum of its proper divisors (1439912698603).
266664440406997 is a wasteful number, since it uses less digits than its factorization.
266664440406997 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 499452123.
The product of its (nonzero) digits is 2257403904, while the sum is 73.
The spelling of 266664440406997 in words is "two hundred sixty-six trillion, six hundred sixty-four billion, four hundred forty million, four hundred six thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •