14572
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 25508
- Proper Divisor Sum (Aliquot Sum)
- 10936
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7284
- Möbius Function
- 0
- Radical
- 7286
- Omega Function (Ω)
- 3
- 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
- 164
- 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
- An intermediate sequence for nonisomorphic circulant self-complementary directed p^2-graphs, indexed by odd primes p.at n=6A038787
- An intermediate sequence for nonisomorphic circulant p^2-tournaments, indexed by odd primes p.at n=6A038791
- Low-temperature partition function expansion for square lattice (Potts model, q=3).at n=18A057377
- a(n) = (1/(2n)) * Sum_{d|n} phi(d) * 2^(2n/d) + (2^((n-4)/2), if n is even).at n=6A058880
- An intermediate sequence for nonisomorphic circulant self-complementary undirected p^2-graphs, indexed by odd primes p.at n=10A061848
- Number of subsets of {1,2,...,n} which sum to 0 modulo n.at n=17A063776
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 9.at n=17A068030
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 18.at n=18A068039
- Sum of digits of numbers between 0 and (1/9)*(10^n-1).at n=4A089903
- Number of frieze patterns of length n under a certain group (see Pisanski et al. for precise definition).at n=9A123045
- 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, 0, 1), (0, 0, 1), (1, -1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150882
- The RSEG2 triangle.at n=41A161739
- Fourth right hand column of the RSEG2 triangle A161739.at n=4A161740
- Numbers n with property that n^2 contains "1234" as a substring.at n=10A175464
- Sampling n numbers between 1 and a(n)-1, you are guaranteed to always find two subsets whose sums are equal.at n=15A180459
- Expansion of Sum_{i>=1} x^(i*(i+1)/2)/(1 - x^(i*(i+1)/2)) / Product_{j>=1} (1 - x^(j*(j+1)/2)).at n=57A281615
- Number of solutions to 1 +- 3 +- 5 +- ... +- (2*n-1) == 0 mod n.at n=17A300218
- Sum of binary ranks of all integer partitions of n, where the binary rank of a partition y is given by Sum_i 2^(y_i-1).at n=13A372890
- Number of integer partitions of n > 0 that are not the first sums of any composition with all parts > 1.at n=34A391620