10311
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15744
- Proper Divisor Sum (Aliquot Sum)
- 5433
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5880
- Möbius Function
- -1
- Radical
- 10311
- 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
- 86
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 33.at n=37A031531
- Lucky numbers with size of gaps equal to 20 (upper terms).at n=21A031903
- Numbers m such that 13^m reversed is prime.at n=6A058995
- Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=23A061364
- Reversal of n equals the sum of the reversals of the proper divisors of n.at n=1A069942
- Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly n ways.at n=5A076459
- 4-Smith numbers.at n=4A103125
- Triangle read by rows: row n lists partitions of n-th triangular number into triangular parts.at n=15A114738
- Numbers of the form 110 + p^2. (where p is a prime).at n=25A138693
- a(n) = (2*n^3 + 5*n^2 - 5*n)/2.at n=20A162265
- Number of isomorphism classes of abelian / medial quandles.at n=9A165200
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=20A208181
- Numbers that match polynomials over {0,1} that have a factor containing -3 as a coefficient; see Comments.at n=3A208182
- Number of nX4 0..3 arrays with no column j greater than or equal to than column j-1 in all rows.at n=1A212939
- T(n,k)=Number of nXk 0..k-1 arrays with no column j greater than or equal to than column j-1 in all rows.at n=11A212943
- Number of 2Xn 0..n-1 arrays with no column j greater than or equal to than column j-1 in all rows.at n=3A212944
- Integers n of the form 8k+7 that are sum of distinct squares of the form m, m+1, m+2, m+4, where m == 1 (mod 4).at n=12A243578
- Irregular triangle read by rows: T(n,k) is the number of primes with n balanced ternary digits of which 2k+1 (3 <= 2k+1 <= n) are nonzero.at n=41A277514
- Number of ways to choose an integer partition of each factor in a factorization of n.at n=32A318948
- Number of ways to write n as an orderless product of orderless sums.at n=32A318949