14162
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21756
- Proper Divisor Sum (Aliquot Sum)
- 7594
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6912
- Möbius Function
- -1
- Radical
- 14162
- 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
- 102
- 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
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A001950 (upper Wythoff sequence).at n=21A025108
- Min{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142.at n=13A094096
- Indices of primes in sequence defined by A(0) = 61, A(n) = 10*A(n-1) + 41 for n > 0.at n=16A101531
- Smallest numbers containing exactly n smaller numbers when written as English number names.at n=16A159453
- Triangle T(n, k) = 1 + (k!)^2 - 2*k!*(n-k)! + ((n-k)!)^2, read by rows.at n=15A173476
- Triangle T(n, k) = 1 + (k!)^2 - 2*k!*(n-k)! + ((n-k)!)^2, read by rows.at n=20A173476
- Triangle T(n, k) = 1 + (k!)^2 - 2*k!*(n-k)! + ((n-k)!)^2, read by rows.at n=22A173476
- Triangle T(n, k) = 1 + (k!)^2 - 2*k!*(n-k)! + ((n-k)!)^2, read by rows.at n=26A173476
- Number of nondecreasing arrangements of n+3 numbers in 0..5 with each number being the sum mod 6 of three others.at n=11A183900
- Beach-Williams Pell numbers of type k^2 + 1.at n=14A212082
- a(n) is the least value of k such that the decimal expansion of n^k contains nine consecutive identical digits.at n=6A217164
- Numbers missing from A001032 despite satisfying the necessary congruence conditions (see comments).at n=33A274469
- Numbers missing from A134419 despite satisfying the necessary congruence conditions (see comments).at n=38A274471
- Sum of the fifth largest parts of the partitions of n into 10 squarefree parts.at n=54A326633
- Number of embeddings on the sphere of 2-connected planar graphs with n nodes up to orientation preserving isomorphisms.at n=5A342058