Base | Representation |
---|---|
bin | 111101110100000001… |
… | …100111001011100010 |
3 | 20100022111220200000000 |
4 | 331310001213023202 |
5 | 2041411444322442 |
6 | 50253534440430 |
7 | 4536510643362 |
oct | 756401471342 |
9 | 210274820000 |
10 | 66371089122 |
11 | 26169827678 |
12 | 10a43663116 |
13 | 6349684200 |
14 | 32d8a9c9a2 |
15 | 1ad6c3cd4c |
hex | f740672e2 |
66371089122 has 162 divisors, whose sum is σ = 162637749027. Its totient is φ = 20303828064.
The previous prime is 66371089117. The next prime is 66371089181. The reversal of 66371089122 is 22198017366.
66371089122 is a `hidden beast` number, since 6 + 637 + 1 + 0 + 8 + 9 + 1 + 2 + 2 = 666.
66371089122 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 5 ways, for example, as 39093593841 + 27277495281 = 197721^2 + 165159^2 .
It is a tau number, because it is divible by the number of its divisors (162).
It is an ABA number since it can be written as A⋅BA, here for A=2, B=182169.
It is an unprimeable number.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 383647828 + ... + 383648000.
Almost surely, 266371089122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66371089122
66371089122 is an abundant number, since it is smaller than the sum of its proper divisors (96266659905).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66371089122 is an frugal number, since it uses more digits than its factorization.
66371089122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 398 (or 191 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 45.
The spelling of 66371089122 in words is "sixty-six billion, three hundred seventy-one million, eighty-nine thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •