Base | Representation |
---|---|
bin | 111100011110111111010001… |
… | …111010011000110111110100 |
3 | 1021212212112022001010001201022 |
4 | 330132333101322120313310 |
5 | 234331321213213102012 |
6 | 2341432212345320312 |
7 | 110013520205530022 |
oct | 7436772172306764 |
9 | 1255775261101638 |
10 | 266012321222132 |
11 | 7783a212448411 |
12 | 25a02b78196098 |
13 | b557b14a50234 |
14 | 49990ca6a3712 |
15 | 20b48ce64c472 |
hex | f1efd1e98df4 |
266012321222132 has 6 divisors (see below), whose sum is σ = 465521562138738. Its totient is φ = 133006160611064.
The previous prime is 266012321222113. The next prime is 266012321222159. The reversal of 266012321222132 is 231222123210662.
It can be written as a sum of positive squares in only one way, i.e., 264790155595876 + 1222165626256 = 16272374^2 + 1105516^2 .
It is a junction number, because it is equal to n+sod(n) for n = 266012321222092 and 266012321222101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33251540152763 + ... + 33251540152770.
It is an arithmetic number, because the mean of its divisors is an integer number (77586927023123).
Almost surely, 2266012321222132 is an apocalyptic number.
It is an amenable number.
266012321222132 is a deficient number, since it is larger than the sum of its proper divisors (199509240916606).
266012321222132 is a wasteful number, since it uses less digits than its factorization.
266012321222132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66503080305537 (or 66503080305535 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 35.
Adding to 266012321222132 its reverse (231222123210662), we get a palindrome (497234444432794).
The spelling of 266012321222132 in words is "two hundred sixty-six trillion, twelve billion, three hundred twenty-one million, two hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •