10150
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
- 24
- Divisor Sum
- 22320
- Proper Divisor Sum (Aliquot Sum)
- 12170
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- 0
- Radical
- 2030
- Omega Function (Ω)
- 5
- 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
- 135
- 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
- yes
- Odd
- no
Appears in sequences
- Positive numbers k such that k and 5*k are anagrams in base 8 (written in base 8).at n=4A023076
- T(2n,n), array T given by A047050.at n=6A047059
- 19-gonal (or enneadecagonal) numbers: n(17n-15)/2.at n=35A051871
- Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives k values.at n=18A053019
- Multiples of 7 whose sum of digits is equal to 7.at n=19A063416
- Numbers n such that ((n-1)^2+1)/2 and n^2+1 and ((n+1)^2+1)/2 are prime if n is even or (n-1)^2+1 and (n^2+1)/2 and (n+1)^2+1 are prime if n is odd.at n=45A082612
- a(n) = (p^2 - 1) / 12, where p is the n-th prime of the form 4*k+1.at n=32A109255
- Number of permutations of n distinct letters (ABCD...) each of which appears 5 times and having n-2 fixed points.at n=28A123296
- 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, 1), (-1, 1, -1), (-1, 1, 1), (1, -1, 0), (1, 1, 0)}.at n=8A149169
- Numbers k such that k![7]-1 is prime (where k![7] = A114799(k) = septuple factorial).at n=53A156167
- A walk of 10-divisible "less regular" figurate cuboctahedra, from sequence A160249.at n=26A160517
- Even almost practical numbers.at n=37A174534
- a(n) = (3*n+7)*(3*n+2)/2.at n=46A179436
- Number of nonnegative integer arrays of length n+2 with new values 0 upwards introduced in order, and containing the value n-1.at n=15A211562
- Number of (w,x,y) with all terms in {0,...,n} and w < range{w,x,y}.at n=28A212967
- Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 2 X n array.at n=43A220154
- G.f.: ( (1 - sqrt(1-32*x)) / (16*x) )^(1/4).at n=4A228411
- Number of n X n 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.at n=4A240777
- Number of nX5 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.at n=4A240780
- T(n,k)=Number of nXk 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.at n=40A240783