Base | Representation |
---|---|
bin | 11110010100100011000010… |
… | …00011101110100111110000 |
3 | 22202002020012220121220001211 |
4 | 33022101201003232213300 |
5 | 32214412340332423243 |
6 | 353450504201205504 |
7 | 20021142541305631 |
oct | 1712214103564760 |
9 | 282066186556054 |
10 | 66676700670448 |
11 | 1a2774802a7aa0 |
12 | 758a484190894 |
13 | 2b2878029448b |
14 | 12672532a1888 |
15 | 7a96323a7d9d |
hex | 3ca4610ee9f0 |
66676700670448 has 80 divisors (see below), whose sum is σ = 142093180454400. Its totient is φ = 30057966973440.
The previous prime is 66676700670421. The next prime is 66676700670449. The reversal of 66676700670448 is 84407600767666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66676700670449) 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, 21884233 + ... + 24744151.
It is an arithmetic number, because the mean of its divisors is an integer number (1776164755680).
Almost surely, 266676700670448 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66676700670448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71046590227200).
66676700670448 is an abundant number, since it is smaller than the sum of its proper divisors (75416479783952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66676700670448 is a wasteful number, since it uses less digits than its factorization.
66676700670448 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2861030 (or 2861024 counting only the distinct ones).
The product of its (nonzero) digits is 341397504, while the sum is 67.
The spelling of 66676700670448 in words is "sixty-six trillion, six hundred seventy-six billion, seven hundred million, six hundred seventy thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •