14142
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 28296
- Proper Divisor Sum (Aliquot Sum)
- 14154
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4712
- Möbius Function
- -1
- Radical
- 14142
- 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
- 58
- 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
- Decimal expansion of sqrt(2) truncated to n places.at n=4A011547
- Decimal expansion of sqrt(2) rounded to n places.at n=4A011548
- Molien series for Gamma_3(2).at n=5A027630
- Numbers which are the sum of their proper divisors containing the digit 7.at n=13A059466
- Index of smallest triangular number with n digits.at n=8A068092
- a(n) = the largest integer whose square has n digits and first digit 1.at n=8A083377
- a(n) = floor(n^(1/n)*10^n).at n=3A093470
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 6 and 9.at n=34A136995
- Let C(n) be the expected length of the longest carry chain when two n-bit binary numbers are added; sequence gives a(n) = 2^(2n-1)*C(n).at n=5A190868
- Number of triangular numbers <= 10^n.at n=8A236043
- Positive even numbers which are neither of the form p + 2^m + 1 nor of the form p + 2^m - 1 with p prime.at n=18A270446
- Number of involutions of [n] having exactly one peak.at n=20A303649
- a(1) = 2; for n > 1, a(n) = a(n-1)*prime(n) if a(n-1)<=prime(n), otherwise a(n) = a(n-1)-prime(n).at n=32A382619
- Expansion of (1/x) * Series_Reversion( x / ((1+x)^2 * (1+x^2*(1+x)^2)) ).at n=7A387497