10051
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
- 6
- Divisor Sum
- 11060
- Proper Divisor Sum (Aliquot Sum)
- 1009
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9108
- Möbius Function
- 0
- Radical
- 437
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 117
- 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
- Discriminants of totally complex sextic fields (negated).at n=1A023687
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers >= 2), t = (natural numbers >= 3).at n=45A024306
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor(n/2).at n=45A024868
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor( n/2 ), s = natural numbers >= 2, t = natural numbers >= 3.at n=44A024869
- a(n) is the smallest number k such that k*2^(2^n) + 1 is prime.at n=18A030239
- Products p^3 or p^2*q, where {p,q} are consecutive primes.at n=23A033477
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 99 ).at n=36A063372
- Numbers which yield a prime whenever a 1 is inserted anywhere in them (including at the beginning or end).at n=62A068679
- Numbers n such that n and n+2 are of the form p^2*q where p and q are distinct primes.at n=34A074173
- a(n) = A077727(n)/n.at n=38A077728
- Least number that requires exactly n iterations of f(x) = reverse(x) - maxdigit(x) to reach zero.at n=19A097156
- Numbers that set a new record for the number of iterations needed to reach 0 under f(x) = reverse(x) - maxdigit(x).at n=16A097158
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k DDUU's, where U=(1,1), D=(1,-1) (0<=k<=floor(n/2)-1 for n>=2).at n=29A114492
- Number of 9-almost primes 9ap such that 2^n < 9ap <= 2^(n+1).at n=20A120040
- Roman numerals with "i" replaced by "1", "v" replaced by "5", "x" replaced by 10, etc., sorted in increasing order.at n=37A130228
- Numbers such that the digital sum base 2 and the digital sum base 5 and the digital sum base 10 all are equal.at n=8A135125
- Numbers having exactly two distinct prime factors p, q with q = p+4.at n=30A143203
- Generalized (3,-1) Catalan numbers.at n=16A144700
- 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, 1, 1), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=8A149042
- a(n) = n*A007504(n)/2 = n*(sum of first n primes)/2.at n=23A156778