Base | Representation |
---|---|
bin | 1010001011101… |
… | …0010110110001 |
3 | 2222100201002210 |
4 | 2202322112301 |
5 | 41413100403 |
6 | 4123202333 |
7 | 1025666214 |
oct | 242722661 |
9 | 88321083 |
10 | 42706353 |
11 | 22119a08 |
12 | 123763a9 |
13 | 8b03641 |
14 | 595977b |
15 | 3b38b03 |
hex | 28ba5b1 |
42706353 has 12 divisors (see below), whose sum is σ = 58304400. Its totient is φ = 27805176.
The previous prime is 42706351. The next prime is 42706361. The reversal of 42706353 is 35360724.
42706353 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42706353 - 21 = 42706351 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42706353.
It is not an unprimeable number, because it can be changed into a prime (42706351) 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 11 ways as a sum of consecutive naturals, for example, 1698 + ... + 9396.
It is an arithmetic number, because the mean of its divisors is an integer number (4858700).
Almost surely, 242706353 is an apocalyptic number.
42706353 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
42706353 is a deficient number, since it is larger than the sum of its proper divisors (15598047).
42706353 is an equidigital number, since it uses as much as digits as its factorization.
42706353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7788 (or 7745 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 30.
The square root of 42706353 is about 6535.0097934127. The cubic root of 42706353 is about 349.5404935880.
The spelling of 42706353 in words is "forty-two million, seven hundred six thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •