1299
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1736
- Proper Divisor Sum (Aliquot Sum)
- 437
- 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
- 864
- Möbius Function
- 1
- Radical
- 1299
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 145
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Restricted partitions.at n=14A002573
- Number of partitions of n into parts 5k+1 or 5k+4.at n=52A003114
- Numbers that are the sum of 3 positive 5th powers.at n=14A003348
- Numbers that are the sum of at most 3 positive 5th powers.at n=28A004843
- Numbers that are the sum of at most 4 positive 5th powers.at n=48A004844
- Coordination sequence T7 for Zeolite Code MFI.at n=23A008170
- E.g.f. log(1+sin(tan(x))).at n=7A009329
- arctanh(sin(tan(x)))=x+3/3!*x^3+41/5!*x^5+1299/7!*x^7+74609/9!*x^9...at n=3A012016
- Number of elements in the set {(x,y): 1 <= x,y <= n, gcd(x,y)=1}.at n=45A018805
- Fibonacci sequence beginning 1, 23.at n=10A022393
- Place where n-th 1 occurs in A007336.at n=42A022775
- Convolution of Fibonacci numbers and (1, prime(1), prime(2), ...).at n=11A023608
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (1, p(1), p(2), ...).at n=12A024470
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=11A024848
- Index of 6^n within the sequence of the numbers of the form 2^i*6^j.at n=31A025712
- Index of 9^n within the sequence of the numbers of the form 7^i*9^j.at n=47A025737
- (d(n)-r(n))/5, where d = A026066 and r is the periodic sequence with fundamental period (0,3,1,0,1).at n=22A026068
- a(n) = Sum_{k=0..n} (k+1) * A026780(n, k).at n=7A027251
- Numbers k such that k-2 and k+2 are consecutive primes.at n=45A029708
- The "semi-Fibonacci numbers": a(n) = A030067(2n - 1), where A030067 is the semi-Fibonacci sequence.at n=45A030068