Base | Representation |
---|---|
bin | 111100101000010001100101… |
… | …101011010000011001101100 |
3 | 1021222010112102201020020222010 |
4 | 330220101211223100121230 |
5 | 234422300113043134202 |
6 | 2343041310024321220 |
7 | 110110600602104502 |
oct | 7450214553203154 |
9 | 1258115381206863 |
10 | 266650455443052 |
11 | 77a6590659756a |
12 | 25aa678a013210 |
13 | b5a305104b6b5 |
14 | 49bbd453d8672 |
15 | 20c62cc2a376c |
hex | f28465ad066c |
266650455443052 has 48 divisors (see below), whose sum is σ = 629217128332800. Its totient is φ = 87878942110080.
The previous prime is 266650455443051. The next prime is 266650455443069. The reversal of 266650455443052 is 250344554056662.
It is a super-2 number, since 2×2666504554430522 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 266650455442983 and 266650455443001.
It is not an unprimeable number, because it can be changed into a prime (266650455443051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7747849 + ... + 24358367.
It is an arithmetic number, because the mean of its divisors is an integer number (13108690173600).
Almost surely, 2266650455443052 is an apocalyptic number.
It is an amenable number.
266650455443052 is an abundant number, since it is smaller than the sum of its proper divisors (362566672889748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
266650455443052 is a wasteful number, since it uses less digits than its factorization.
266650455443052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16625646 (or 16625644 counting only the distinct ones).
The product of its (nonzero) digits is 103680000, while the sum is 57.
The spelling of 266650455443052 in words is "two hundred sixty-six trillion, six hundred fifty billion, four hundred fifty-five million, four hundred forty-three thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •