Base | Representation |
---|---|
bin | 1010001100011… |
… | …0110110000010 |
3 | 2222110022021100 |
4 | 2203012312002 |
5 | 41421220011 |
6 | 4124235230 |
7 | 1026301311 |
oct | 243066602 |
9 | 88408240 |
10 | 42757506 |
11 | 22154390 |
12 | 1239bb16 |
13 | 8b209cc |
14 | 5970278 |
15 | 3b48d56 |
hex | 28c6d82 |
42757506 has 96 divisors (see below), whose sum is σ = 108501120. Its totient is φ = 12038400.
The previous prime is 42757489. The next prime is 42757531. The reversal of 42757506 is 60575724.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 186600 + ... + 186828.
It is an arithmetic number, because the mean of its divisors is an integer number (1130220).
Almost surely, 242757506 is an apocalyptic number.
42757506 is a gapful number since it is divisible by the number (46) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 42757506, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54250560).
42757506 is an abundant number, since it is smaller than the sum of its proper divisors (65743614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42757506 is a wasteful number, since it uses less digits than its factorization.
42757506 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312 (or 309 counting only the distinct ones).
The product of its (nonzero) digits is 58800, while the sum is 36.
The square root of 42757506 is about 6538.9223882839. The cubic root of 42757506 is about 349.6799959457.
It can be divided in two parts, 4275 and 7506, that added together give a triangular number (11781 = T153).
The spelling of 42757506 in words is "forty-two million, seven hundred fifty-seven thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •