Base | Representation |
---|---|
bin | 11110001000010101110000… |
… | …01010100001101100000010 |
3 | 22200121010120001010002121110 |
4 | 33010022320022201230002 |
5 | 32141024324322302031 |
6 | 352530055102504150 |
7 | 16645633360261446 |
oct | 1704127012415402 |
9 | 280533501102543 |
10 | 66257255275266 |
11 | 1a1255a9309470 |
12 | 7521124895056 |
13 | 2ac8056141953 |
14 | 1250c22744826 |
15 | 79d783795c46 |
hex | 3c42b82a1b02 |
66257255275266 has 32 divisors (see below), whose sum is σ = 145287722880000. Its totient is φ = 19977061888080.
The previous prime is 66257255275243. The next prime is 66257255275301.
66257255275266 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×662572552752662 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a junction number, because it is equal to n+sod(n) for n = 66257255275197 and 66257255275206.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2522343166 + ... + 2522369433.
It is an arithmetic number, because the mean of its divisors is an integer number (4540241340000).
Almost surely, 266257255275266 is an apocalyptic number.
66257255275266 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
66257255275266 is an abundant number, since it is smaller than the sum of its proper divisors (79030467604734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66257255275266 is a wasteful number, since it uses less digits than its factorization.
66257255275266 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5044712814.
The product of its digits is 635040000, while the sum is 66.
The spelling of 66257255275266 in words is "sixty-six trillion, two hundred fifty-seven billion, two hundred fifty-five million, two hundred seventy-five thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •