Base | Representation |
---|---|
bin | 1001101100011100011… |
… | …1100111111110010010 |
3 | 120220220010010020221000 |
4 | 2123013013213332102 |
5 | 10212043123000340 |
6 | 204302312042430 |
7 | 15014151504621 |
oct | 2330707477622 |
9 | 526803106830 |
10 | 166549421970 |
11 | 646a6896898 |
12 | 28341093416 |
13 | 12923102a39 |
14 | 80bd6a16b8 |
15 | 44eb951d30 |
hex | 26c71e7f92 |
166549421970 has 64 divisors (see below), whose sum is σ = 448062243840. Its totient is φ = 44020134144.
The previous prime is 166549421933. The next prime is 166549421977. The reversal of 166549421970 is 79124945661.
166549421970 is a `hidden beast` number, since 1 + 6 + 6 + 549 + 4 + 2 + 1 + 97 + 0 = 666.
It is a super-2 number, since 2×1665494219702 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (166549421977) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2698914 + ... + 2759933.
It is an arithmetic number, because the mean of its divisors is an integer number (7000972560).
Almost surely, 2166549421970 is an apocalyptic number.
166549421970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
166549421970 is an abundant number, since it is smaller than the sum of its proper divisors (281512821870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166549421970 is a wasteful number, since it uses less digits than its factorization.
166549421970 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5458976 (or 5458970 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 54.
The spelling of 166549421970 in words is "one hundred sixty-six billion, five hundred forty-nine million, four hundred twenty-one thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •