Base | Representation |
---|---|
bin | 111110001101011010… |
… | …000001101001101001 |
3 | 20101102012012002022211 |
4 | 332031122001221221 |
5 | 2043300002410101 |
6 | 50404105445121 |
7 | 4553201306152 |
oct | 761532015151 |
9 | 211365162284 |
10 | 66796919401 |
11 | 26368135223 |
12 | 10b421a07a1 |
13 | 63b696a8a4 |
14 | 3339468929 |
15 | 1b0e304c51 |
hex | f8d681a69 |
66796919401 has 27 divisors (see below), whose sum is σ = 74288903493. Its totient is φ = 60043336320.
The previous prime is 66796919393. The next prime is 66796919461. The reversal of 66796919401 is 10491969766.
The square root of 66796919401 is 258451.
It is a perfect power (a square), and thus also a powerful number.
66796919401 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 4 ways, for example, as 21905480025 + 44891439376 = 148005^2 + 211876^2 .
It is not a de Polignac number, because 66796919401 - 23 = 66796919393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66796919461) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 101054011 + ... + 101054671.
Almost surely, 266796919401 is an apocalyptic number.
66796919401 is the 258451-st square number.
66796919401 is the 129226-th centered octagonal number.
It is an amenable number.
66796919401 is a deficient number, since it is larger than the sum of its proper divisors (7491984092).
66796919401 is an frugal number, since it uses more digits than its factorization.
66796919401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1402 (or 701 counting only the distinct ones).
The product of its (nonzero) digits is 4408992, while the sum is 58.
The spelling of 66796919401 in words is "sixty-six billion, seven hundred ninety-six million, nine hundred nineteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •