Base | Representation |
---|---|
bin | 11110010110111001001010… |
… | …11010001100101101010000 |
3 | 22202100221021022120212002001 |
4 | 33023130211122030231100 |
5 | 32222222424400302022 |
6 | 353551514321003344 |
7 | 20030025143022301 |
oct | 1713344532145520 |
9 | 282327238525061 |
10 | 66757304306512 |
11 | 1a2a8682a15856 |
12 | 75a201a183554 |
13 | 2b33257498ba1 |
14 | 126b0dc28c7a8 |
15 | 7ab79d861b27 |
hex | 3cb72568cb50 |
66757304306512 has 10 divisors (see below), whose sum is σ = 129342277093898. Its totient is φ = 33378652153248.
The previous prime is 66757304306507. The next prime is 66757304306549. The reversal of 66757304306512 is 21560340375766.
66757304306512 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 47865033423936 + 18892270882576 = 6918456^2 + 4346524^2 .
It is a super-2 number, since 2×667573043065122 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2086165759563 + ... + 2086165759594.
Almost surely, 266757304306512 is an apocalyptic number.
It is an amenable number.
66757304306512 is a deficient number, since it is larger than the sum of its proper divisors (62584972787386).
66757304306512 is a wasteful number, since it uses less digits than its factorization.
66757304306512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4172331519165 (or 4172331519159 counting only the distinct ones).
The product of its (nonzero) digits is 19051200, while the sum is 55.
The spelling of 66757304306512 in words is "sixty-six trillion, seven hundred fifty-seven billion, three hundred four million, three hundred six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •