13956
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 32592
- Proper Divisor Sum (Aliquot Sum)
- 18636
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4648
- Möbius Function
- 0
- Radical
- 6978
- Omega Function (Ω)
- 4
- 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
- 89
- 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
- Numbers whose base-7 representation contains exactly four 5's.at n=14A043416
- McKay-Thompson series of class 32a for the Monster group.at n=37A107635
- 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, 0, 1), (1, -1, 1), (1, 1, 0), (1, 1, 1)}.at n=7A150933
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=12A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=13A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=14A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=15A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=16A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=17A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=18A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=19A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=20A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=21A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=22A174538
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=23A174538
- (k(n)!-j(n)!)/n, where (k!,j!) is the least pair of distinct factorials for which n divides k!-j!.at n=25A204937
- Number of Dyck n-paths all of whose ascents and descents have lengths equal to 1 (mod 5).at n=24A212364
- Triangular array read by rows. T(n,k) is the number of functions f:{1,2,...,n}->{1,2,...,n} that have exactly k recurrent elements whose preimage contains only one element, n>=0, 0<=k<=n.at n=21A220234
- Positive integers m such that pi(m^2) = pi(j^2) + pi(k^2) for no 0 < j <= k < m.at n=45A262408
- Numbers that are the sum of seven fourth powers in five or more ways.at n=28A345571