4612
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8078
- Proper Divisor Sum (Aliquot Sum)
- 3466
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2304
- Möbius Function
- 0
- Radical
- 2306
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 152
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of strict 3rd-order maximal independent sets in path graph.at n=39A007384
- Coordination sequence T2 for Zeolite Code MAZ.at n=47A008145
- Coordination sequence T5 for Zeolite Code MFI.at n=43A008168
- Molien series of 4-dimensional representation of cyclic group of order 4 over GF(2) (not Cohen-Macaulay).at n=46A008610
- Numbers k such that the continued fraction for sqrt(k) has period 70.at n=10A020409
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 10.at n=14A022324
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).at n=23A024598
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor(n/2), s = (odd natural numbers).at n=22A025112
- a(n) = sum of the numbers between the two n's in A026358.at n=34A026361
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 28 ones.at n=40A031796
- Number of unordered sets a, b, c, d of distinct integers from 1..n such that a+b+c+d = 0 (mod n).at n=49A032801
- a(n) = a(n-1) + a(round(2*(n-1)/3)) + a(round((n-1)/3)) with a(1)=1, a(2)=2.at n=27A033500
- a(n)-th and (a(n)+1)-st primes are the first pair of primes that differ by exactly 2n; a(n) = -1 if no such pair of primes exists.at n=28A038664
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 5 sites wide.at n=29A058368
- Integer part of log(n^n)^log(n).at n=11A062431
- Permutation of N induced by rotating the node 5 left in the infinite planar binary tree shown at A065658.at n=35A065669
- Interprimes which are of the form s*prime, s=4.at n=19A075279
- Even interprimes from A075688.at n=14A075689
- Numbers n such that phi(n) = sigma(sum of distinct prime factors of n).at n=11A075865
- Largest k such that round(1/(sqrt(prime(k+1))-sqrt(prime(k)))) = n where prime(n) denotes the n-th prime (conjectured values).at n=6A078693