11768
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22080
- Proper Divisor Sum (Aliquot Sum)
- 10312
- 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
- 0
- Radical
- 2942
- Omega Function (Ω)
- 4
- 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
- 174
- 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
- a(n) = prime(n)^2 - prime(n+1).at n=28A062235
- Structured pentagonal hexacontahedral numbers (vertex structure 16).at n=7A100169
- (1/2)*number of regular tetrahedra that can be formed using the points in an (n+1) X (n+1) X (n+1) lattice cube.at n=11A103158
- Nonisomorphic catacondensed monoheptafusenes (see reference for precise definition).at n=8A121071
- Number of numbers <= p^2 with largest prime factor <= p, where p is the n-th prime; a(0) = 1.at n=41A184677
- G.f.: exp( Sum_{n>=1} A224678(n^2) * x^n/n ).at n=5A224681
- Values x of successive minima records of k = log(x)/log(d) where d runs through the positive values of x^3-round(sqrt(x^3))^2.at n=13A232536
- Number of nX4 0..2 arrays with no element equal to the sum of elements to its left or one plus the sum of elements above it, modulo 3.at n=7A239026
- T(n,k)=Number of nXk 0..2 arrays with no element equal to the sum of elements to its left or one plus the sum of the elements above it, modulo 3.at n=62A239030
- a(n) = 7*n^2 + 1.at n=41A247541
- Convolution of A000203 and A000009.at n=28A277029
- Sum of the odd parts in the partitions of n into 9 parts.at n=31A309657
- Number of nX4 0..1 arrays with every element unequal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=5A317819
- Number of nX6 0..1 arrays with every element unequal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=3A317821
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=39A317823
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=41A317823
- Successive records of function f(x) = log(abs(pi(x) - R(x)))/log(x) where pi(x) is the number of primes <= x and R(x) is Riemann's prime counting function.at n=34A353055
- Internal digits of k^3 include digits of k as substring, k does not end in 0.at n=6A383640
- The smallest positive number k such that A066686(k,n) is a substring of A051129(n,k), or -1 if no such k exists.at n=2A390224