5423
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6480
- Proper Divisor Sum (Aliquot Sum)
- 1057
- 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
- 4480
- Möbius Function
- -1
- Radical
- 5423
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 67
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(n+4)*(n+5)/6.at n=29A005586
- Number of 1's in n-th term of A022482.at n=30A022484
- Expansion of Product_{m>=1} (1+m*q^m)^29.at n=3A022657
- First occurrence of n as a term in the continued fraction for zeta(3).at n=48A033165
- Number of partitions of n into parts not of the form 21k, 21k+10 or 21k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=31A035988
- a(n) = least number not of form [ (a^2/n) ] + [ (b^2)/n ].at n=23A036575
- a(1) = 1; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=43A074336
- Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n.at n=15A074348
- Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.at n=52A075780
- Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.at n=47A075780
- Triangle T(n,k) = f(n,k,n-2), n >= 0, 0 <= k <= n, where f is given below.at n=69A075837
- Triangle T(n,k) = f(n,k,n-2), n >= 0, 0 <= k <= n, where f is given below.at n=74A075837
- Expansion of Molien series for a certain 4-D group of order 48.at n=45A078411
- Numbers m that divide binomial(m*(m+1), m+1)/m^2.at n=35A082529
- Alternating sum of the Fibonacci numbers multiplied by their (combinatorial) indices.at n=14A120940
- a(n) = (n-2)*(n+3)*(n+2)/6.at n=31A129936
- Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 7, read by rows.at n=11A153652
- Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 7, read by rows.at n=13A153652
- Totally multiplicative sequence with a(p) = 6p-1 for prime p.at n=29A166655
- Numbers k that divide the sum of digits of 13^k.at n=20A175525