13042
domain: N
Properties
Digital Properties
- Digit Count
- 5
- 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
- 19566
- Proper Divisor Sum (Aliquot Sum)
- 6524
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6520
- Möbius Function
- 1
- Radical
- 13042
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 182
- 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
- Positive numbers k such that k and 2*k are anagrams in base 6 (written in base 6).at n=6A023064
- Positive numbers k such that k and 3*k are anagrams in base 6 (written in base 6).at n=11A023065
- Numbers n such that n^1024 + 1 is prime (a generalized Fermat prime).at n=18A057002
- Numbers whose digits are a permutation of (0,...,m) for some m.at n=37A199168
- In base 5, numbers n which have 5 distinct digits, do not start with 0, and have property that the product (written in base 5) of any two adjacent digits is a substring of n.at n=1A210016
- Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array.at n=24A219349
- Let an integer with k+1 digits as n = d(k)*10^k + d(k-1)*10^(k-1) + ... + d(0)*10^0 and consider the transform T(n) = k*10^d(k) + (k-1)*10^d(k-1) + ... + 0*10^d(0). a(n) gives the fixed points of the transform T(n).at n=17A226767
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 0.at n=37A259574
- Number of 2Xn 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=12A280400
- Expansion of Product_{k>=1} (1 + x^(2*k-1))^(k*(3*k-2))*(1 + x^(2*k))^(k*(3*k+2)).at n=11A294841
- Starting with a(1) = 0, a(2) = 1, a(n) = smallest nonnegative integer that shares all digits with previous terms. No repeated digits are allowed.at n=38A297062
- Integers x such that [f(0), f(f(0)), ..., f(...f(0)...)] is a permutation of [0, 1, ..., k-1], where k is the number of digits in x and f(a) denotes the 0-based index of the first occurrence of the substring a in x.at n=12A307620
- Always start on the lowest digit of a(n), then visit all digits of a(n) in increasing order. The terms of the sequence are the smallest one that force the visitor to walk n steps to complete his tour (a single step drives you from a digit to the closest one).at n=10A336611