Base | Representation |
---|---|
bin | 1010001000110… |
… | …0001001010000 |
3 | 2222000002110101 |
4 | 2202030021100 |
5 | 41341021242 |
6 | 4115142144 |
7 | 1024250323 |
oct | 242141120 |
9 | 88002411 |
10 | 42517072 |
11 | 21aaa784 |
12 | 122a4954 |
13 | 8a68440 |
14 | 590a7ba |
15 | 3aec9b7 |
hex | 288c250 |
42517072 has 40 divisors (see below), whose sum is σ = 89994240. Its totient is φ = 19340160.
The previous prime is 42517063. The next prime is 42517091. The reversal of 42517072 is 27071524.
It is a super-2 number, since 2×425170722 = 3615402822906368, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42517072.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13329 + ... + 16207.
It is an arithmetic number, because the mean of its divisors is an integer number (2249856).
Almost surely, 242517072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42517072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44997120).
42517072 is an abundant number, since it is smaller than the sum of its proper divisors (47477168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42517072 is a wasteful number, since it uses less digits than its factorization.
42517072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2971 (or 2965 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 28.
The square root of 42517072 is about 6520.5116363672. The cubic root of 42517072 is about 349.0233233729.
Adding to 42517072 its reverse (27071524), we get a palindrome (69588596).
The spelling of 42517072 in words is "forty-two million, five hundred seventeen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •