Base | Representation |
---|---|
bin | 1010001010010… |
… | …1101010011101 |
3 | 2222012101211200 |
4 | 2202211222131 |
5 | 41402342342 |
6 | 4121310113 |
7 | 1025164134 |
oct | 242455235 |
9 | 88171750 |
10 | 42621597 |
11 | 22071267 |
12 | 12335339 |
13 | 8aa3ba5 |
14 | 593691b |
15 | 3b1d94c |
hex | 28a5a9d |
42621597 has 6 divisors (see below), whose sum is σ = 61564542. Its totient is φ = 28414392.
The previous prime is 42621589. The next prime is 42621611. The reversal of 42621597 is 79512624.
42621597 is a `hidden beast` number, since 4 + 2 + 62 + 1 + 597 = 666.
42621597 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 36832761 + 5788836 = 6069^2 + 2406^2 .
It is not a de Polignac number, because 42621597 - 23 = 42621589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42621547) 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 5 ways as a sum of consecutive naturals, for example, 2367858 + ... + 2367875.
It is an arithmetic number, because the mean of its divisors is an integer number (10260757).
Almost surely, 242621597 is an apocalyptic number.
It is an amenable number.
42621597 is a deficient number, since it is larger than the sum of its proper divisors (18942945).
42621597 is a wasteful number, since it uses less digits than its factorization.
42621597 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4735739 (or 4735736 counting only the distinct ones).
The product of its digits is 30240, while the sum is 36.
The square root of 42621597 is about 6528.5218081890. The cubic root of 42621597 is about 349.3091051082.
The spelling of 42621597 in words is "forty-two million, six hundred twenty-one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •