10833
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15168
- Proper Divisor Sum (Aliquot Sum)
- 4335
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6864
- Möbius Function
- -1
- Radical
- 10833
- 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
- 68
- 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
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=32A007419
- a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=54A023109
- Numbers whose set of base-15 digits is {2,3}.at n=27A032815
- Bessel function Y_0(n) is a monotonically decreasing positive sequence.at n=23A046961
- Bessel function |Y_0(n)| is a monotonically decreasing positive sequence.at n=40A046963
- n plus a googol is prime.at n=30A049014
- Indices of record high values in A033665, ignoring those numbers that are believed never to reach a palindrome.at n=9A065198
- Numbers n such that 54 'Reverse and Add' steps are needed to reach a palindrome.at n=0A065321
- a(1) = 4; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=46A074341
- Number of partitions of n with parts occurring at most thrice and an even number of parts. Row sums of A098489.at n=44A098491
- Number of partitions of n with parts occurring at most thrice and an odd number of parts. Row sums of A098490.at n=44A098492
- 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, 1), (0, 1, -1), (0, 1, 1), (1, -1, 1), (1, 0, 0)}.at n=7A150636
- Number of nX3 0..2 arrays with row sums equal and column sums equal.at n=5A203559
- Number of n X 6 0..2 arrays with row sums equal and column sums equal.at n=2A203562
- T(n,k) = Number of n X k 0..2 arrays with row sums equal and column sums equal.at n=30A203564
- T(n,k) = Number of n X k 0..2 arrays with row sums equal and column sums equal.at n=33A203564
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=30A208181
- Numbers that match polynomials over {0,1} that have a factor containing -3 as a coefficient; see Comments.at n=10A208182
- Number of triples (w,x,y) with all terms in {0,...,n} and w >= floor((x+y)/3).at n=24A212972
- Number of rooted trees with n nodes having some subtrees replaced by cycles.at n=13A213683