6462
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14040
- Proper Divisor Sum (Aliquot Sum)
- 7578
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2148
- Möbius Function
- 0
- Radical
- 2154
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 168
- 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
- Number of binary partitions: number of partitions of 2n into powers of 2.at n=45A000123
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t is A000201 (lower Wythoff sequence).at n=34A023866
- a(n) = position of n^3 + 9 in A003072.at n=38A024971
- Numbers m such that m^2 ends in 444.at n=25A039685
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5).at n=31A039839
- Decimal concatenations of the quadruples (d1,d2,d3,d4) with elements in {2,4,6} for which there exists a prime p >= 5 such that the differences between the 5 consecutive primes starting with p are (d1,d2,d3,d4).at n=19A078868
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; then a(n) is the number of partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p <= A000230(n).at n=48A079023
- a(n) = A026905(n) - A014284(n).at n=23A086741
- Numbers k such that (2^k - 1)^2 - 2 = 4^k - 2^(k+1) - 1 is prime.at n=28A091515
- Numbers n such that prime(n) == -7 (mod n).at n=15A092049
- Numbers k such that prime(k+1) == 1 (mod k).at n=13A105286
- Numbers j such that j divides the sum of the digits of j!.at n=18A108825
- This list of numbers a(i) has the property that every left-subset of length n > 0 of the numbers a(i) is divisible by i+n and are the largest such integers for every i.at n=15A113538
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 7 multiples of n-1, n-2, ..., 1, for n>=1.at n=44A113744
- Start with 1 and repeatedly reverse the digits and add 61 to get the next term.at n=14A118156
- Exactly one of (2^n-1)^2-2 and (2^n+1)^2-2 is prime.at n=50A173888
- Number of strings of numbers x(i=1..n) in 0..3 with sum i^3*x(i)^2 equal to n^3*9.at n=13A184297
- Number of strings of numbers x(i=1..7) in 0..n with sum i^3*x(i)^2 equal to 343*n^2.at n=15A184308
- Second differences of A000219.at n=17A191660
- Number of (n+1) X 2 0..2 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards.at n=3A206535