14478
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30720
- Proper Divisor Sum (Aliquot Sum)
- 16242
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4536
- Möbius Function
- 1
- Radical
- 14478
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- yes
- Odd
- no
Appears in sequences
- A generalized partition function.at n=17A002600
- Number of tree-rooted toroidal maps with 3 faces and n vertices and without separating loops or isthmuses.at n=2A006435
- a(n) = 10*n^2+n.at n=37A055437
- Number of bits in A127962(n).at n=28A127965
- Difference between the sums of the first 10^n odd primes and the first 10^n odd positive integers > 1.at n=1A134182
- Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 5 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=n-n%2, read by rows.at n=55A231145
- Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 10 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=5*floor(n/2), read by rows.at n=30A238586
- Subdiagonal partitions: number of partitions (p1, p2, p3, ...) of n with pi <= i.at n=39A238875
- Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j,-n)*S1(k,j), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n.at n=51A271699
- a(n) is the number of partitions of n with Durfee square of size <= 4.at n=35A330642
- a(n) = (prime(n)+1) * prime(n+1).at n=29A345727
- Consecutive states of the linear congruential pseudo-random number generator for the Texas Instruments TI99 when started at 1.at n=17A384221