4473
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
- 7488
- Proper Divisor Sum (Aliquot Sum)
- 3015
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2520
- Möbius Function
- 0
- Radical
- 1491
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 95
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = position of n^2 + (n+1)^2 + (n+2)^2 in A004432.at n=41A024809
- Numbers that are the sum of 3 distinct positive cubes in 2 or more ways.at n=26A024974
- Coordination sequence T4 for Zeolite Code MWW.at n=45A024989
- Numbers that are the sum of 3 positive cubes in exactly 2 ways.at n=39A025396
- Numbers that are the sum of 3 distinct positive cubes in exactly 2 ways.at n=26A025400
- a(n) is root of square starting with digit 2: first term of runs.at n=6A035069
- Positive numbers having the same set of digits in base 7 and base 9.at n=20A037439
- a(n) = T(2n-1,n), array T given by A048225.at n=35A048234
- Concatenation of n in base 10 down up to base 2 is prime, all numbers are interpreted as decimals.at n=39A054257
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.at n=29A057285
- Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition.at n=24A057949
- Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition.at n=21A057950
- Partial sums of Chebyshev sequence S(n,8) = U(n,4) = A001090(n+1).at n=4A076765
- Main diagonal of array in A082191.at n=43A082194
- Take the list t(n,0) = {1,...,n}; denote by t(n,j) this list after rotating to left (or right) by j positions. Calculate inner product of t(n,0) and t(n,j) and denote the value by s(n,j). Compute this inner product for all j = 1..n and choose the smallest. This is a(n).at n=26A088003
- Number of primes with number of 1-bits <= number of 0-bits (A095075) in range ]2^n,2^(n+1)].at n=16A095055
- Number of A095287-primes in range ]2^n,2^(n+1)].at n=16A095297
- Numbers n such that 2*reversal(n)=sigma(n).at n=4A105324
- Numbers k such that the k-th triangular number contains only digits {0,1,6}.at n=10A119042
- Second bisection of A061041: a(n) = A061041(2n+1) = (2*n+1)*(2*n+9).at n=31A145923