10535
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15048
- Proper Divisor Sum (Aliquot Sum)
- 4513
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7056
- Möbius Function
- 0
- Radical
- 1505
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 192
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor((3rd elementary symmetric function of 2,3,...,n+3)/(2+3+...+n+3)).at n=19A024178
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=26A031947
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n+3)/3.at n=23A048086
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=26A049357
- Numbers k that divide 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k.at n=28A057490
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=23A070192
- Triangle read by rows, defined by T(n,k) = C(n,k)*S2(n,k), 0 <= k <= n, where C(n,k) are the binomial coefficients and S2(n,k) are the Stirling numbers of the second kind.at n=31A090683
- a(n) = n*(n+7)*(n+8)/6.at n=35A111396
- sigma(n) plus the n-th prime gives a square.at n=41A114082
- 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, -1, 0), (-1, 0, 0), (-1, 1, 1), (1, 0, -1), (1, 0, 0)}.at n=9A148644
- Numbers k which can be split into two numbers x and y such that x^3 + y^2 is a multiple of k.at n=30A162451
- Number of binary strings of length n with no substrings equal to 0000 0101 or 0111.at n=15A164433
- a(n) = 5*n^2 - n + 1.at n=46A172043
- Numbers n not divisible by 2 or 3 such that k^k == k+1 (mod n) has no nonzero solutions.at n=45A191834
- Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=3A207738
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=31A207741
- Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207742
- Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=2|x-y|+2|y-z|.at n=35A212576
- a(n) = smallest number greater than n, equal to the determinant of the circulant matrix formed by its base-n digits.at n=34A219357
- The Wiener index of the graph obtained by applying Mycielski's construction to the cycle graph C(n).at n=36A228320