10455
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
- 16
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 7689
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5120
- Möbius Function
- 1
- Radical
- 10455
- Omega Function (Ω)
- 4
- 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
- 55
- 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
- Positive numbers k such that k and 5*k are anagrams in base 6 (written in base 6).at n=4A023067
- a(n) is the sum of squares of the first n positive integers congruent to 2 mod 3.at n=14A024394
- Base-7 palindromes that start with 4.at n=33A043018
- Numbers n for which there are exactly five k such that n = k + (product of nonzero digits of k).at n=34A096926
- Conjectured numbers n such that the trajectory of n as defined in A003508 is unique.at n=40A105233
- Row sums of triangle A105632.at n=10A105633
- Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k UDUU's, 0 <= k <= floor((n-1)/2).at n=31A116424
- Primitive elements of A119432.at n=19A119433
- Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5), starting 1,0,0,0,1.at n=18A124313
- Odd interprimes divisible by 17.at n=35A124620
- 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, 0), (-1, 1, 1), (0, 1, -1), (1, 0, 0)}.at n=9A148642
- a(n) = 4*n^2 + 73*n + 333.at n=41A157431
- Partial sums of floor(n^2/3) (A000212).at n=45A181286
- Number of n X n symmetric 0..5 arrays with no element equal to any horizontal or vertical neighbor and with new values 0..5 introduced in lower triangular row major order.at n=3A193271
- 3rd term of continued fraction for sqrt(2)^sqrt(2)^...^sqrt(2) with n sqrt(2)'s.at n=23A198094
- Number of n X 3 0..2 arrays with rows and columns lexicographically nondecreasing read forwards and nonincreasing read backwards.at n=8A201695
- Composite squarefree numbers n such that p(i)-9 divides n+9, where p(i) are the prime factors of n.at n=36A225709
- Products p*q*r*s of distinct primes for which (p*q*r*s - 1)/2 is prime.at n=20A234498
- Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1); triangle T(n,k), n>=0, read by rows.at n=45A243752
- Number of Dyck paths of semilength n avoiding the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1).at n=11A243754