Base | Representation |
---|---|
bin | 101000000001110… |
… | …001000000110110 |
3 | 1201210122100112100 |
4 | 220001301000312 |
5 | 2333404122132 |
6 | 150345402530 |
7 | 22433044134 |
oct | 5001610066 |
9 | 1653570470 |
10 | 671551542 |
11 | 315089682 |
12 | 168a99446 |
13 | a918b69c |
14 | 65290754 |
15 | 3de5337c |
hex | 28071036 |
671551542 has 48 divisors (see below), whose sum is σ = 1545251760. Its totient is φ = 210180096.
The previous prime is 671551513. The next prime is 671551549. The reversal of 671551542 is 245155176.
671551542 is a `hidden beast` number, since 67 + 1 + 5 + 51 + 542 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 671551497 and 671551506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (671551549) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 29958 + ... + 47334.
It is an arithmetic number, because the mean of its divisors is an integer number (32192745).
Almost surely, 2671551542 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 671551542, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (772625880).
671551542 is an abundant number, since it is smaller than the sum of its proper divisors (873700218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
671551542 is a wasteful number, since it uses less digits than its factorization.
671551542 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17517 (or 17514 counting only the distinct ones).
The product of its digits is 42000, while the sum is 36.
The square root of 671551542 is about 25914.3115285743. The cubic root of 671551542 is about 875.7089403333.
The spelling of 671551542 in words is "six hundred seventy-one million, five hundred fifty-one thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •