5468
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 9576
- Proper Divisor Sum (Aliquot Sum)
- 4108
- 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
- 2732
- Möbius Function
- 0
- Radical
- 2734
- 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
- 41
- 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
- Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1.at n=37A005424
- Coordination sequence T5 for Zeolite Code DDR.at n=46A008075
- Coordination sequence T10 for Zeolite Code MFI.at n=47A008162
- a(n) = Sum_{j=0..i, i=0..n} T(i,j), where T is the array in A026374.at n=10A026384
- Number of partitions of n that do not contain 3 as a part.at n=34A027337
- Number of binary [ n,5 ] codes.at n=11A034359
- Number of binary [ n,7 ] codes.at n=11A034361
- Numerators of continued fraction convergents to sqrt(177).at n=5A041326
- Numerators of continued fraction convergents to sqrt(999).at n=6A042934
- Row sums of A051599.at n=10A053210
- a(n) = (5*3^(n-1)+1)/2.at n=7A057198
- Expansion of (1-x)/(1-2*x-x^2-x^3).at n=10A077997
- Map from binary trees of size n to the set of corresponding trivalent plane trees (tpt) represented as size 2n+1 general trees.at n=15A083930
- Partial sums of A005578.at n=13A086445
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 78.at n=2A093278
- Numbers k such that A003313(k) = A003313(3*k).at n=32A116459
- a(n) = 5*a(n-1) + 3 with a(0) = 1.at n=5A117617
- Records in A018892.at n=40A126097
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 0, -1), (1, 0, 0), (1, 1, 0)}.at n=7A150327
- a(n) = (4^n + 20)/3.at n=7A156605