2026
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3042
- Proper Divisor Sum (Aliquot Sum)
- 1016
- 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
- 1012
- Möbius Function
- 1
- Radical
- 2026
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 112
- 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
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=51A001000
- a(n) = n^2 + 1.at n=45A002522
- Second-order Eulerian numbers: a(n) = 2^n - 2*n.at n=11A005803
- Number of factors in the infinite word formed by the Kolakoski sequence A000002.at n=47A007782
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=37A011905
- Linear recursion relative of Shallit sequence S(2,6).at n=6A014010
- a(n) = floor(log(5)^n).at n=16A014216
- Define the Shallit sequence S(a_0,a_1) by a_{n+2} is the least integer > a_{n+1}^2/a_n for n >= 0. This is S(2,6).at n=6A018906
- a(n) = 3*a(n-1)+a(n-2)-a(n-3)+a(n-6)-a(n-7)+a(n-10)-a(n-11).at n=6A022041
- Least m such that if r and s in {Pi/2 - atn(h): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k.at n=50A024832
- a(n) = position of the n-th n in A026400.at n=41A026403
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 90.at n=0A031768
- Numbers k such that 97*2^k+1 is prime.at n=9A032398
- Concatenation of n and n + 6 or {n,n+6}.at n=19A032611
- Number of disconnected 4-valent (or quartic) graphs with n nodes.at n=17A033483
- Fractional part of square root of n starts with 0: first term of runs (squares excluded).at n=40A034106
- Number of partitions of n into parts 5k+1 and 5k+2 with at least one part of each type.at n=47A035631
- Coordination sequence T1 for Zeolite Code STF.at n=30A038443
- Numbers k such that 2 and 6 occur juxtaposed in the base-10 representation of k but not of k-1.at n=40A043236
- Numbers k such that 2 and 6 occur juxtaposed in the base-10 representation of k but not of k+1.at n=40A044016