Base | Representation |
---|---|
bin | 1010001110000… |
… | …1110110101001 |
3 | 2222122221000210 |
4 | 2203201312221 |
5 | 41433240022 |
6 | 4130451333 |
7 | 1030241664 |
oct | 243416651 |
9 | 88587023 |
10 | 42868137 |
11 | 2221a514 |
12 | 12433b49 |
13 | 8b5c180 |
14 | 599c6db |
15 | 3b6ba0c |
hex | 28e1da9 |
42868137 has 16 divisors (see below), whose sum is σ = 62169408. Its totient is φ = 26116800.
The previous prime is 42868121. The next prime is 42868171. The reversal of 42868137 is 73186824.
42868137 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 42868137 - 24 = 42868121 is a prime.
It is a super-3 number, since 3×428681373 (a number of 24 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 42868095 and 42868104.
It is not an unprimeable number, because it can be changed into a prime (42868117) 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 15 ways as a sum of consecutive naturals, for example, 1503 + ... + 9380.
It is an arithmetic number, because the mean of its divisors is an integer number (3885588).
Almost surely, 242868137 is an apocalyptic number.
It is an amenable number.
42868137 is a deficient number, since it is larger than the sum of its proper divisors (19301271).
42868137 is a wasteful number, since it uses less digits than its factorization.
42868137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11000.
The product of its digits is 64512, while the sum is 39.
The square root of 42868137 is about 6547.3763447659. The cubic root of 42868137 is about 349.9813241736.
The spelling of 42868137 in words is "forty-two million, eight hundred sixty-eight thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •