12355
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16992
- Proper Divisor Sum (Aliquot Sum)
- 4637
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8448
- Möbius Function
- -1
- Radical
- 12355
- 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
- 112
- 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
- no
- Odd
- yes
Appears in sequences
- [ (3rd elementary symmetric function of 3,4,...,n+4)/(3+4+...+n+4) ].at n=19A024191
- Base 8 palindromes that start with 3.at n=19A043023
- Number of subsets of {1, ..., n} that are sum-free but not double-free.at n=21A088811
- a(n) = 2*3^n - 3*2^n + 1.at n=8A091344
- Triangle read by rows: T(n,k) is the number of bicolored Dyck paths of semilength n and having k peaks of the form ud (0 <= k <= n). A bicolored Dyck path is a Dyck path in which each up-step is of two kinds: u and U.at n=31A114608
- Irregular triangle read by rows: T(n,k) (n>=1, 0<=k<=n(n-1)/2) is such that Sum_k T(n,k)*q^k gives the expectation of the number of connected components in a random graph on n labeled vertices where every edge is present with probability q.at n=50A125210
- a(n) = 15*n^2 - 9*n + 1.at n=29A134154
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,k+n} having excedance set {1,2,...,k} (the empty set for k=0), 0 <= k <= n-1.at n=47A136126
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,k+n} having excedance set {1,2,...,k} (the empty set for k=0), 0 <= k <= n-1.at n=52A136126
- Number of permutations of 1..n with i-7<=p(i)<=i+2.at n=9A179344
- Triangular array: Number of partitions of the vertex set of a forest of two trees on n vertices into k nonempty independent sets.at n=58A227341
- a(n) = Lucas(n) concatenated with Fibonacci(n).at n=10A247337
- Palindromic numbers in bases 4 and 8 written in base 10.at n=34A259382
- The icosagen sequence : a(n) = A018227(n)-5, for n >= 2.at n=38A271997
- a(n) = Sum_{d|n} (n/d)^d * binomial(d+n-1,d).at n=7A363668
- Odd binary Niven numbers (A144302) k such that k/wt(k) is also an odd binary Niven number, where wt(k) = A000120(k) is the binary weight of k.at n=32A376618