13434
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26880
- Proper Divisor Sum (Aliquot Sum)
- 13446
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4476
- Möbius Function
- -1
- Radical
- 13434
- 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
- 89
- 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
- Expansion of Product_{m>=1} (1+x^m)^6.at n=10A022571
- Numbers k such that k^2 contains exactly 9 different digits.at n=14A054037
- Numbers k such that k | 6^k + 5^k + 4^k + 3^k + 2^k.at n=26A057256
- Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=21A084276
- Number of one-element transitions among partitions of the integer n for labeled parts.at n=17A094533
- Write 1/e as a binary fraction; read this from left to right and whenever a 1 appears, note the integer formed by reading leftwards from that 1.at n=7A099969
- E.g.f.: A(x) = Sum_{n>=0} log( Sum_{k=0..n} C(n,k)^2*x^k )^n*x^n/(n!*n^n).at n=5A180654
- Number of nondecreasing arrangements of 6 numbers x(i) in -(n+4)..(n+4) with the sum of sign(x(i))*x(i)^2 zero.at n=17A188006
- Number of 2 X 2 matrices having all elements in {0,1,...,n} and determinant in the open interval (-n,n).at n=14A211032
- a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2, 1] as of [2, 1, 3].at n=9A211299
- Integers n such that appending some decimal digit to the first n digits of Pi results in a prime.at n=29A231336
- Number of nX3 0..2 arrays with no element less than a strict majority of its horizontal, vertical and antidiagonal neighbors.at n=3A231658
- Number of nX4 0..2 arrays with no element less than a strict majority of its horizontal, vertical and antidiagonal neighbors.at n=2A231659
- T(n,k)=Number of nXk 0..2 arrays with no element less than a strict majority of its horizontal, vertical and antidiagonal neighbors.at n=17A231663
- T(n,k)=Number of nXk 0..2 arrays with no element less than a strict majority of its horizontal, vertical and antidiagonal neighbors.at n=18A231663
- Number of (n+2)X(7+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=24A254906
- Approximation of the 2-adic integer arctanh(2) up to 2^n.at n=14A309753
- Number of symmetric Euclidean pseudo-order types: nondegenerate abstract order types of configurations of n points in the plane with a nontrivial automorphism.at n=9A325595
- Number of nonnegative solutions to (x_1)^2 + (x_2)^2 + ... + (x_6)^2 <= n.at n=41A341401
- Least number k > 1 not a power of 10 such that k^n, n > 2, starts with k, or -1 if no such number exists.at n=37A362175