1238
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1860
- Proper Divisor Sum (Aliquot Sum)
- 622
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 618
- Möbius Function
- 1
- Radical
- 1238
- 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
- 132
- 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
- yes
- Odd
- no
Appears in sequences
- Number of rooted ternary trees with n nodes; number of n-carbon alkyl radicals C(n)H(2n+1) ignoring stereoisomers.at n=11A000598
- Numbers k such that phi(2k-1) < phi(2k), where phi is Euler's totient function A000010.at n=17A001836
- Number of partitions of n that do not contain 1 as a part.at n=31A002865
- Coordination sequence T2 for Zeolite Code MEP.at n=21A008158
- Coordination sequence T3 for Zeolite Code RTE.at n=24A009892
- Coefficients in expansion of Pi as Sum_{n>=1} a(n)/(n*n!*(n+1)!), as found by greedy algorithm.at n=40A011191
- a(n) = floor( n*(n-1)*(n-2)/29 ).at n=34A011911
- Continued fraction for Conway's constant.at n=69A014967
- Coordination sequence T3 for Zeolite Code OSI.at n=23A016432
- a(n) = Sum_{k = 1..n} k*floor((n + prime(k))/k).at n=22A024929
- Number of partitions of n into distinct parts >= 6.at n=66A025151
- Numbers that are the sum of 3 nonzero squares in 10 or more ways.at n=35A025338
- Numbers that are the sum of 3 distinct nonzero squares in exactly 10 ways.at n=19A025348
- Numbers that are the sum of 3 distinct nonzero squares in 9 or more ways.at n=40A025355
- Numbers that are the sum of 3 distinct nonzero squares in 10 or more ways.at n=27A025356
- Number of partitions of n into an odd number of parts, the least being 6; also, a(n+6) = number of partitions of n into an even number of parts, each >=6.at n=66A027192
- Number of distinct products i*j with 0 <= i, j <= 2^n - 1.at n=6A027417
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 34.at n=8A031532
- Number of edges in 12-partite Turán graph of order n.at n=52A033444
- Multiplicity of highest weight (or singular) vectors associated with character chi_66 of Monster module.at n=34A034454