14235
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24864
- Proper Divisor Sum (Aliquot Sum)
- 10629
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6912
- Möbius Function
- 1
- Radical
- 14235
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 50
- 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
- no
- Odd
- yes
Appears in sequences
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=44A000125
- Positive numbers k such that k and 2*k are anagrams in base 6 (written in base 6).at n=15A023064
- Numbers having four 3's in base 8.at n=25A043436
- Number of permutations in S_n avoiding the strings 123, 321 and 231.at n=12A060696
- Number of pentagonal regions in regular n-gon with all diagonals drawn.at n=34A067152
- Sum of product of odd numbers <= n and the product of even numbers <= n.at n=10A076051
- Array read by rows in which the n-th row contains the multiples of n in increasing order using all the digits of first n numbers.at n=18A078189
- Number of partitions of n^2 into squares providing no dissections of the square n X n into smaller squares.at n=14A092179
- Numbers k such that 6*R_k + 1 is a prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=28A096507
- Bisection of A000125.at n=22A100503
- Where record values of A119999 occur.at n=38A120001
- Matrix square of triangle U = A136228, read by rows.at n=32A136233
- 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, 0, 0), (0, 0, 1), (1, -1, 0), (1, -1, 1), (1, 1, -1)}.at n=9A148478
- Composites that are the sum of two, three, four and five consecutive composite numbers.at n=19A151745
- Partial sums of A036967.at n=16A176273
- Smallest multiple of 13 such that decimals digits 1, ..., k (k = 1, ..., 9) and 0 appear in any order.at n=4A178303
- Permutations of 12345: Numbers having each of the decimal digits 1,...,5 exactly once, and no other digit.at n=12A178475
- Triangular array read by rows: T(n,k) is the number of ways to partition an n-set into exactly k blocks and then partially order the blocks, n>=1, 1<=k<=n.at n=18A247231
- Fixed points of the function A260529(n) = concatenation of the positions of digits 9, 8,..., 0 in the decimal representation of n, using 1 for the rightmost digit etc., skipping digits which don't occur.at n=19A260275
- Numbers n which divide A260521(n), the concatenation of the positions of the digits 9, 8, ..., 0 in the decimal representation of n, where positions are counted from the right, and 0 if a given digit does not occur.at n=42A260386