Base | Representation |
---|---|
bin | 1100011011010101… |
… | …01100001000010000 |
3 | 122012222001210100010 |
4 | 12031222230020100 |
5 | 102130431324202 |
6 | 3022010354520 |
7 | 324221621133 |
oct | 61552541020 |
9 | 18188053303 |
10 | 6671745552 |
11 | 29140321aa |
12 | 136242ba40 |
13 | 8242c4844 |
14 | 47411021a |
15 | 290ac876c |
hex | 18daac210 |
6671745552 has 20 divisors (see below), whose sum is σ = 17235342800. Its totient is φ = 2223915168.
The previous prime is 6671745499. The next prime is 6671745559. The reversal of 6671745552 is 2555471766.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 138994699 = 6671745552 / (6 + 6 + 7 + 1 + 7 + 4 + 5 + 5 + 5 + 2).
It is not an unprimeable number, because it can be changed into a prime (6671745559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 69497302 + ... + 69497397.
It is an arithmetic number, because the mean of its divisors is an integer number (861767140).
Almost surely, 26671745552 is an apocalyptic number.
It is an amenable number.
6671745552 is an abundant number, since it is smaller than the sum of its proper divisors (10563597248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6671745552 is a wasteful number, since it uses less digits than its factorization.
6671745552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138994710 (or 138994704 counting only the distinct ones).
The product of its digits is 1764000, while the sum is 48.
The square root of 6671745552 is about 81680.7538652772. The cubic root of 6671745552 is about 1882.5498778514.
The spelling of 6671745552 in words is "six billion, six hundred seventy-one million, seven hundred forty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •