Base | Representation |
---|---|
bin | 1010001011010… |
… | …0010011001010 |
3 | 2222022110002000 |
4 | 2202310103022 |
5 | 41411302141 |
6 | 4122451430 |
7 | 1025533665 |
oct | 242642312 |
9 | 88273060 |
10 | 42681546 |
11 | 22102306 |
12 | 12363b76 |
13 | 8ac526b |
14 | 59506dc |
15 | 3b315b6 |
hex | 28b44ca |
42681546 has 64 divisors (see below), whose sum is σ = 98703360. Its totient is φ = 13662000.
The previous prime is 42681539. The next prime is 42681547. The reversal of 42681546 is 64518624.
It is a self number, because there is not a number n which added to its sum of digits gives 42681546.
It is not an unprimeable number, because it can be changed into a prime (42681547) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 169921 + ... + 170171.
It is an arithmetic number, because the mean of its divisors is an integer number (1542240).
Almost surely, 242681546 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42681546, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49351680).
42681546 is an abundant number, since it is smaller than the sum of its proper divisors (56021814).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42681546 is a wasteful number, since it uses less digits than its factorization.
42681546 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376 (or 370 counting only the distinct ones).
The product of its digits is 46080, while the sum is 36.
The square root of 42681546 is about 6533.1115098397. Note that the first 3 decimals coincide. The cubic root of 42681546 is about 349.4728008453.
The spelling of 42681546 in words is "forty-two million, six hundred eighty-one thousand, five hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •