12340
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
- 12
- Divisor Sum
- 25956
- Proper Divisor Sum (Aliquot Sum)
- 13616
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4928
- Möbius Function
- 0
- Radical
- 6170
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- Positive numbers k such that k and 3*k are anagrams in base 5 (written in base 5).at n=9A023062
- Numbers k such that 80*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=8A056663
- Each permutation in the list A060118 converted to Site Swap notation, with digits reversed and inverted. "Zero throws" (fixed elements) indicated with 0's.at n=38A060499
- Fourth column (r=3) of FS(3) staircase array A062745.at n=39A062748
- Smallest multiple of n which begins with the concatenation of first n natural numbers.at n=3A074158
- Smallest multiple of n that begins with the concatenation of the positive integers <= n and coprime to n (in increasing order).at n=4A078217
- A014486-indices of A083932-trees.at n=27A083934
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+617)^2 = y^2.at n=6A115135
- Moebius transform of tetrahedral numbers.at n=40A117108
- Smallest number containing exactly n distinct numbers in its decimal representation.at n=14A120005
- Triangle T, read by rows, where column k of T equals (k+1)*(column k of T^2) when shifted to have an initial '1'; i.e., T(n,k) = (k+1)*[T^2](n-1,k) for n>k>=0, with T(n,n)=1 for n>=0.at n=28A123305
- Column 0 of triangle A123305.at n=7A123306
- Numbers whose digits are a permutation of (0,...,m) for some m.at n=33A199168
- a(n) = (-1)^(n-3)*binomial(n,3) - 1.at n=40A216414
- 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=16A226767
- a(n) = Sum_{i=0..n} digsum_7(i)^3, where digsum_7(i) = A053828(i).at n=43A231678
- Number of partitions p of n such that (maximal multiplicity of the parts of p) >= (number of distinct parts of p).at n=37A240308
- Smallest number k such that A270172(k) = n.at n=36A270173
- Numbers n such that Bernoulli number B_{n} has denominator 330.at n=34A272183
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 901", based on the 5-celled von Neumann neighborhood.at n=20A273744