Base | Representation |
---|---|
bin | 1100011101100… |
… | …0101010100001 |
3 | 10122100110210001 |
4 | 3013120222201 |
5 | 101340031211 |
6 | 5104140001 |
7 | 1203160624 |
oct | 307305241 |
9 | 118313701 |
10 | 52267681 |
11 | 2755a534 |
12 | 15607601 |
13 | aaa062b |
14 | 6d27dbb |
15 | 48c6ac1 |
hex | 31d8aa1 |
52267681 has 8 divisors (see below), whose sum is σ = 53050464. Its totient is φ = 51490560.
The previous prime is 52267669. The next prime is 52267693. The reversal of 52267681 is 18676225.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (52267669) and next prime (52267693).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52267681 - 213 = 52259489 is a prime.
It is a super-2 number, since 2×522676812 = 5463820954235522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52267681.
It is not an unprimeable number, because it can be changed into a prime (52267181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19386 + ... + 21916.
It is an arithmetic number, because the mean of its divisors is an integer number (6631308).
Almost surely, 252267681 is an apocalyptic number.
It is an amenable number.
52267681 is a deficient number, since it is larger than the sum of its proper divisors (782783).
52267681 is a wasteful number, since it uses less digits than its factorization.
52267681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2831.
The product of its digits is 40320, while the sum is 37.
The square root of 52267681 is about 7229.6390642964. The cubic root of 52267681 is about 373.8904828659.
The spelling of 52267681 in words is "fifty-two million, two hundred sixty-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •