Base | Representation |
---|---|
bin | 10001011001101100010001 |
3 | 22120202110011 |
4 | 101121230101 |
5 | 2131433211 |
6 | 241434521 |
7 | 53526235 |
oct | 21315421 |
9 | 8522404 |
10 | 4561681 |
11 | 2636293 |
12 | 163ba41 |
13 | c39427 |
14 | 86a5c5 |
15 | 601921 |
hex | 459b11 |
4561681 has 4 divisors (see below), whose sum is σ = 4708864. Its totient is φ = 4414500.
The previous prime is 4561663. The next prime is 4561723. The reversal of 4561681 is 1861654.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1861654 = 2 ⋅930827.
It is a cyclic number.
It is not a de Polignac number, because 4561681 - 27 = 4561553 is a prime.
It is a super-2 number, since 2×45616812 = 41617867091522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 147151 = 4561681 / (4 + 5 + 6 + 1 + 6 + 8 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4561621) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73545 + ... + 73606.
It is an arithmetic number, because the mean of its divisors is an integer number (1177216).
Almost surely, 24561681 is an apocalyptic number.
It is an amenable number.
4561681 is a deficient number, since it is larger than the sum of its proper divisors (147183).
4561681 is a wasteful number, since it uses less digits than its factorization.
4561681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147182.
The product of its digits is 5760, while the sum is 31.
The square root of 4561681 is about 2135.8092143260. The cubic root of 4561681 is about 165.8472611608.
The spelling of 4561681 in words is "four million, five hundred sixty-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •