10676
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19908
- Proper Divisor Sum (Aliquot Sum)
- 9232
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- 0
- Radical
- 5338
- Omega Function (Ω)
- 4
- 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
- 148
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=46A024305
- a(n) = A026637(2*n, n-2).at n=6A026640
- Number of 2 X 2 matrices with elements from {0,1,2,...,n} and with Nim-Determinant 1. (The Nim-Determinant of the 2 X 2 matrix [a,b; c,d] is defined to be a*d xor b*c, where * denotes Nim-Multiplication.)at n=35A059954
- Numbers n such that the sum of the digits of sigma(n)^phi(n) is divisible by n.at n=13A109669
- phi(n) plus the n-th prime gives a cube.at n=8A114085
- phi(n) plus the n-th prime gives a square.at n=32A116021
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (0, 0, 1), (1, 0, 0), (1, 0, 1)}.at n=7A151051
- Sequence A154690 adjusted to leading one:t(n,m)=A154690(n,m)-A154690(n,0)+1.at n=57A174669
- Row sums of number triangle A185962.at n=23A185963
- Number of nX2 0..6 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..6 introduced in row major order.at n=4A209459
- Number of nX5 0..6 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..6 introduced in row major order.at n=1A209462
- T(n,k)=Number of nXk 0..6 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..6 introduced in row major order.at n=16A209465
- T(n,k)=Number of nXk 0..6 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..6 introduced in row major order.at n=19A209465
- The chalcogen sequence (a(n) = A018227(n)-2).at n=36A271994
- Number of 4 X n 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=14A281472
- Number of 5-cycles in the n X n king graph.at n=18A288919
- Third diagonal sequence of the Sheffer triangle A094816 (special Charlier).at n=15A290312
- a(n) = digsum(2^a(n-1)) with a(0) = 0.at n=28A330822
- a(n) = sum of the origin-to-boundary graph-distances of all partitions of n.at n=26A368986
- Expansion of 1 + Sum_{i>=1} Sum_{j>=1} x^(i*j) * Product_{k=1..i*j-1} (1+x^k).at n=47A373030