13023
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18824
- Proper Divisor Sum (Aliquot Sum)
- 5801
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8676
- Möbius Function
- 0
- Radical
- 4341
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 76
- 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
- no
- Odd
- yes
Appears in sequences
- A Fielder sequence: a(n) = a(n-1) + a(n-2) - a(n-7), n >= 8.at n=20A001636
- Values of A038005 ending in 3.at n=12A038013
- Partial sums of A068058 + 1.at n=42A068059
- Sum of composite numbers less than n-th prime.at n=41A079725
- Sum of first n 5-almost primes.at n=40A086047
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1.at n=15A096024
- Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0.at n=37A096554
- Number of ways to label the vertices of the octahedron (or faces of the cube) with nonnegative integers summing to n, where labelings that differ only by rotation or reflection are considered the same.at n=33A097513
- Indices of primes in the sequence defined by A(0) = 13, A(n) = 10*A(n-1) + 23 for n > 0.at n=6A102019
- Minimum number of moves to solve the second Panex puzzle of order n of exchanging the two side towers.at n=8A109224
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1101-1111 pattern in any orientation.at n=15A146867
- 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, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150848
- Smallest of three consecutive integers divisible respectively by three consecutive squares greater than 1.at n=3A178919
- Augmentation of the Euler partition triangle A026820. See Comments.at n=40A193591
- Numbers n that divide the sum of digits of 36^n.at n=37A220364
- On a spirally numbered square grid, with labels starting at 1, this is the number of steps that an (n,n+1) leaper makes before getting trapped, or -1 if it never gets trapped.at n=14A343178
- Numbers k such that k and k+2 both have exactly 6 divisors.at n=44A356743
- Number of distinct determinants of 3 X 3 matrices with entries from {0, 1, ..., n}.at n=16A366158