11490
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
- 27648
- Proper Divisor Sum (Aliquot Sum)
- 16158
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3056
- Möbius Function
- 1
- Radical
- 11490
- 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
- 37
- 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
- yes
- Odd
- no
Appears in sequences
- Number of precomplete Post functions.at n=5A002825
- Numbers with exactly 4 distinct palindromic prime factors.at n=26A046402
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=21A047826
- a(n+1) = a(n) + (if a(n) is odd then (next odd square) else (next even square)), a(0) = 1.at n=21A116955
- Partial sums of primes that are not Chen primes (starting with 1).at n=35A118483
- Averages of twin primes such that the sum of the lower, average and upper parts of the twin primes are averages of other twin primes.at n=7A132929
- Omit first term from A160539 and divide by 7.at n=9A160549
- Numbers k such that the average digit of k^2 is 1.at n=16A164771
- Natural numbers n such that Sum_{k = 1..pi(n)-1} p(k) == p(pi(n)) mod n, where p(k) denotes the k-th prime and pi(n) is the number of primes strictly less than n.at n=10A196223
- a(n) = n*(3*n^2 + 6*n + 1).at n=15A196507
- Triangle read by rows: T(n,k) is the number of weighted lattice paths B(n) having k uHd strings.at n=24A247292
- Number of weighted lattice paths B(n) having no uHd strings.at n=13A247293
- Numbers k such that k is the average of four consecutive primes k-7, k-1, k+1 and k+7.at n=18A258879
- Erroneous version of A002825.at n=5A259339
- Numbers m with m-1, m+1 and prime(m)+2 all prime.at n=26A259539
- Squarefree numbers n such that n^2 + 1 and n^2 - 1 are semiprime.at n=17A268697
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 195", based on the 5-celled von Neumann neighborhood.at n=25A270691
- Numbers k such that 3 is the largest decimal digit of k^2.at n=13A277960
- Numbers of the form prime(i-1)+prime(i+1) that are the average of a twin prime pair.at n=40A342993
- Products of four distinct primes between twin primes.at n=33A353022