Base | Representation |
---|---|
bin | 1111000010011… |
… | …1110101101110 |
3 | 11101200200101200 |
4 | 3300213311232 |
5 | 112121441432 |
6 | 10131550330 |
7 | 1364103060 |
oct | 360476556 |
9 | 141620350 |
10 | 63077742 |
11 | 32673272 |
12 | 1915b3a6 |
13 | 100b6b10 |
14 | 853d730 |
15 | 580ea7c |
hex | 3c27d6e |
63077742 has 96 divisors (see below), whose sum is σ = 170369472. Its totient is φ = 16422912.
The previous prime is 63077741. The next prime is 63077743. The reversal of 63077742 is 24777036.
It is an interprime number because it is at equal distance from previous prime (63077741) and next prime (63077743).
It is a junction number, because it is equal to n+sod(n) for n = 63077697 and 63077706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63077741) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 158688 + ... + 159084.
It is an arithmetic number, because the mean of its divisors is an integer number (1774682).
Almost surely, 263077742 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 63077742, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85184736).
63077742 is an abundant number, since it is smaller than the sum of its proper divisors (107291730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63077742 is a wasteful number, since it uses less digits than its factorization.
63077742 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 522 (or 519 counting only the distinct ones).
The product of its (nonzero) digits is 49392, while the sum is 36.
The square root of 63077742 is about 7942.1497089894. The cubic root of 63077742 is about 398.0693253985.
The spelling of 63077742 in words is "sixty-three million, seventy-seven thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •