11453
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12348
- Proper Divisor Sum (Aliquot Sum)
- 895
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10560
- Möbius Function
- 1
- Radical
- 11453
- 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
- 81
- 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
- Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) < cn(1,5) + cn(4,5) + cn(3,5).at n=33A039846
- McKay-Thompson series of class 33B for Monster.at n=38A058637
- Number of distinct characteristic polynomials among all simple undirected graphs on n nodes.at n=7A082104
- Structured truncated octahedral numbers.at n=12A100155
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 2-cell columns starting at level 0 (n >= 1; 0 <= k <= n-1).at n=40A121634
- Numerator of Laguerre(n, -6).at n=6A160607
- Number of digits of A014980(n) in decimal representation.at n=17A194079
- Number of partitions of n in which any two parts differ by at most 9.at n=37A218511
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..6 array extended with zeros and convolved with 1,4,6,4,1.at n=19A221997
- Numbers n where tau(n) and n-tau(n) are perfect squares, with tau(n) the number of divisors of n (A000005).at n=27A245197
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=30A245208
- a(n) = n*A259968(n).at n=13A259969
- Integers m such that A006218(m) is triangular.at n=44A263457
- a(n) = prime(1)^2 + prime(n)^2.at n=27A287922
- Number of n X 5 0..1 arrays with every element unequal to 0, 1 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=10A299592
- Number of tilings of a 6 X n rectangle using pentominoes of shapes X, Y, T and dominoes.at n=5A321589
- Sum of the smallest parts of the partitions of n into 9 parts.at n=46A326465
- a(1) = 1; if a(n) is not divisible by 3, a(n+1) = 4*a(n) + 1, otherwise a(n+1) = a(n)/3.at n=28A346035
- Semiprimes of the form k^2 + 4.at n=22A360741