11020
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 14180
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 0
- Radical
- 5510
- Omega Function (Ω)
- 5
- 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
- 161
- 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
- Number of 3-valent trees (= boron trees or binary trees) with n nodes.at n=18A000672
- Number of ordered 5-tuples of integers from [ 1..n ] with no global factor.at n=14A015650
- a(n) = prime(n)*prime(n-1) - 1.at n=27A023515
- Number of 3-valent trees (= boron trees or binary trees) with n nodes.at n=37A052120
- Number of complementary pairs of circulant digraphs on n nodes.at n=17A054930
- Multiples of 4 whose digits add to 4.at n=15A063997
- Consider the sequence b(k) such that b(k) and sigma(b(k)) end with the same digit in base 10. Sequence gives values of b(k) such that b(k)/k = 10.at n=16A065255
- a(n) = Sum_{d|n} d*Fibonacci(n/d).at n=20A066769
- A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives y's for indecomposable Wallis pairs with x < y (ordered by values of x).at n=24A075769
- Sequence A085188 shown in factorial base. (The longest prefix which can be shown with digits < 10.)at n=34A085187
- "Lazy binary" representation of n. Also called redundant binary representation of n.at n=28A089591
- a(n) = 114 written in base n.at n=2A095618
- a(n) = 114 written in base 10 - n.at n=7A095619
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at even heights.at n=40A101919
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at an odd height.at n=31A101920
- Indices of primes in sequence defined by A(0) = 13, A(n) = 10*A(n-1) - 27 for n > 0.at n=18A102006
- a(n) = A051707(A025487).at n=25A108460
- Triangle read by rows: T(n,k) is number of ordered trees with n edges and having exactly k vertices all of whose children are leaves (1<=k<=floor(n/2) for n>=2).at n=34A114502
- Numbers beginning with a vowel in French.at n=22A118557
- Number of maximal sum-free subsets of {1,2,...,n}.at n=33A121269