13139
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15024
- Proper Divisor Sum (Aliquot Sum)
- 1885
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11256
- Möbius Function
- 1
- Radical
- 13139
- Omega Function (Ω)
- 2
- 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
- 213
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Largest number in largest finite set fixed by mapping f(k) = sum of n-th power of digits of k.at n=4A046529
- Limit set for operation of repeatedly replacing a number with the sum of the 4th power of its digits.at n=13A113708
- a(n) is the sum of all distinct integers that can be produced by reversing the digits of n in any base b >= 2.at n=50A211518
- Number of length n 0..6 arrays with each partial sum starting from the beginning no more than sqrt(3) standard deviations from its mean.at n=4A244938
- T(n,k)=Number of length n 0..k arrays with each partial sum starting from the beginning no more than sqrt(3) standard deviations from its mean.at n=49A244940
- Number of length 5 0..n arrays with each partial sum starting from the beginning no more than sqrt(3) standard deviations from its mean.at n=5A244944
- Numbers k such that 10^k + 123456789 is prime.at n=12A248349
- Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 4 6 or 7.at n=6A252427
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7.at n=34A252433
- Number of (7+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7.at n=1A252440
- Number of compositions of n if only the order of parts 1 and 2 matters.at n=19A289249
- Numbers that are the sum of 4 nonzero 4th powers in more than one way.at n=26A309763
- The number of (n-2)-interval parking functions of size n.at n=9A327794
- Numbers that are the sum of four fourth powers in exactly two ways.at n=26A344193
- Numbers that are the sum of nine fourth powers in nine or more ways.at n=25A345593
- Numbers that are the sum of nine fourth powers in exactly nine ways.at n=22A345851
- Number of subsets of the first n nonzero decimal palindromes whose sum is a nonzero decimal palindrome.at n=16A377122