13958
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23952
- Proper Divisor Sum (Aliquot Sum)
- 9994
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5976
- Möbius Function
- -1
- Radical
- 13958
- 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
- 89
- 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
- yes
- Odd
- no
Appears in sequences
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u1.at n=30A048189
- Number of partitions of n into >= 2 parts and with minimum part >= 2.at n=44A083751
- Numbers n such that the sum of the digits of n^phi(n) is divisible by n.at n=25A109660
- 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, 0, 0), (0, -1, 1), (0, 1, 1), (1, 1, -1)}.at n=9A148830
- Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=16A254904
- Number of length n+6 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=34A255997
- Sum over all partitions lambda of n into 3 distinct parts of Product_{i:lambda} prime(i).at n=11A258358
- Expansion of Product_{k>=1} 1/(1 + x^k)^(k-1).at n=47A319109
- Numbers that are the sum of nine fourth powers in exactly nine ways.at n=28A345851
- Irregular triangle read by rows: T(n, k) is the number of chains of subspaces 0 < V_1 < ... < V_r = (F_2)^n, counted up to coordinate permutation, with dimension increments given by (any fixed permutation of) the parts of the k-th partition of n in Abramowitz-Stegun order.at n=42A348113
- Number of integer partitions of n where 2*(number of distinct parts) >= (number of parts).at n=39A361394
- Except a(0)=1 and a(4)=0, number of integer partitions of n with no 1's and at least two parts.at n=45A379720
- Total number of ways of partitioning n and any natural number less than or equal to n into the same number of parts, treating partitions of n and itself in a different order as distinct.at n=15A380125
- Triangle T(n,k) read by rows: T(n,k) is the coefficient of x^k of the monic polynomial (1+x)^n + ((2*(1+x))^n - (2+x)^n) / x.at n=40A391610