14200
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 33480
- Proper Divisor Sum (Aliquot Sum)
- 19280
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5600
- Möbius Function
- 0
- Radical
- 710
- Omega Function (Ω)
- 6
- 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
- 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
- Number of ways of placing n nonattacking queens on an n X n board.at n=12A000170
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A048149.at n=29A049712
- Number of edges in all simple (loopless) paths, connecting any node with all the remaining ones in optimal graphs of degree 4.at n=7A058227
- Shadow of Euler's constant exp(1).at n=34A108912
- n+p(n)+p(p(n)) is a palindrome, where p(n) denotes the n-th prime.at n=24A116037
- a(n) = 100^[n/10] + 2*n*10^[n/10]: inspired by Engel expansion of Pi.at n=21A137507
- Erroneous duplicate of A000170, see comments.at n=11A140393
- Let x(0)x(1)x(2)... x(q) denote the decimal expansion of n. Sequence lists the numbers n such that the suffix of decimal expansion x(2)... x(q) is the p-th divisor of n where p is the prefix of decimal expansion x(0)x(1).at n=6A234315
- Number of balanced orbitals over n sectors.at n=19A241810
- Number of balanced orbitals over an odd number of sectors.at n=9A242087
- Least k formed by the concatenation of two numbers n and d such that d is the n-th divisor of k, or 0 if no such k exists.at n=13A257491
- Numbers m such that the concatenation of k and the k-th divisor of m is equal to m for some k.at n=16A258738
- Number of ways to place m nonattacking queens on an m X n board, 1 <= m <= n (triangular array).at n=77A269133
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 1006", based on the 5-celled von Neumann neighborhood.at n=31A273861
- Sum over all partitions of n into distinct parts of the bitwise XOR of the parts.at n=38A306925
- Numbers k such that 393*2^k+1 is prime.at n=48A323041
- Records of A058249: (Smallest prime >= 2^n) - (largest prime <= 2^n).at n=35A331620
- Number of subsets of {1..n} where no two elements sum to a prime.at n=25A391562