13140
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 40404
- Proper Divisor Sum (Aliquot Sum)
- 27264
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- 0
- Radical
- 2190
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- Probable extension of A013704.at n=20A025495
- Numbers that have exactly six prime factors counted with multiplicity (A046306) whose digit reversal is different and also has 6 prime factors (with multiplicity).at n=17A109026
- Moebius transform of tetrahedral numbers.at n=43A117108
- Terms of A068563 that are not terms of A124240.at n=50A124241
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=12.at n=10A135197
- 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, 0), (-1, 0, -1), (0, 1, 1), (1, 0, 0)}.at n=9A149841
- 3 times 12-gonal (or dodecagonal) numbers: a(n) = 3*n*(5*n-4).at n=30A153448
- a(n) = 1458*n + 18.at n=8A157505
- a(n) = A160799(n)/4.at n=36A160807
- Difference A063990(2n)-A063990(2n-1) between amicable numbers.at n=36A178542
- Number of lunar divisors (in base 10) of the n-th nonzero number whose decimal expansion contains only 0's and 1's (A007088(n)).at n=45A186951
- Number of lunar divisors (in base 10) of the n-th nonzero number whose decimal expansion contains only 0's and 1's (A007088(n)).at n=57A186951
- Maximum number of tatami tilings of any m X m square region with exactly n horizontal dimers and m monomers.at n=26A192096
- Augmentation of the triangular array P=A094727 given by p(n,k)=n+k+1 for 0<=k<=n. See Comments.at n=18A193093
- Number of defective 4-colorings of an n X 1 0..3 array connected horizontally, antidiagonally and vertically with exactly two mistakes, and colors introduced in row-major 0..3 order.at n=9A229665
- T(n,k) = number of defective 4-colorings of an n X k 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order.at n=45A229755
- T(n,k) = number of defective 4-colorings of an n X k 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order.at n=54A229755
- Number of singletons (strong fixed points) in pair-partitions.at n=6A233481
- Numbers m such that A166133(m+1) = A166133(m)^2 - 1.at n=21A256703
- Number of nX5 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.at n=2A269049