7069
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 7070
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 7068
- Möbius Function
- -1
- Radical
- 7069
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 150
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 908
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- From a Goldbach conjecture: records in A185091.at n=42A002092
- Expansion of log(1+tan(sinh(x))).at n=7A009365
- arctanh(tan(sinh(x)))=x+5/3!*x^3+121/5!*x^5+7069/7!*x^7+763057/9!*x^9...at n=3A012156
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=8A015992
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 48 ones.at n=16A031816
- Numbers whose set of base-12 digits is {1,4}.at n=22A032824
- Minimal elements of pairs of "Super Unitary Amicable Numbers", sorted by their minimal elements.at n=23A045613
- Primes with first digit 7.at n=25A045713
- Primes whose decimal expansion is a concatenation of two or more consecutive decreasing numbers (no leading zeros allowed).at n=7A052088
- Primes formed by concatenating k with k-1.at n=7A052089
- a(n) = Sum_{k = 1..10^n} d(k) where d(n) = number of divisors of n (A000005).at n=3A057494
- Numbers k such that k^k + k - 1 is prime.at n=6A058912
- Primes p such that x^31 = 2 has no solution mod p.at n=27A059225
- Primes p such that x^19 = 2 has no solution mod p.at n=40A059244
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=7A065216
- Duplicate of A052089.at n=7A068699
- Numbers k such that 4*k! + 1 is prime.at n=24A076680
- a(n) = a(n-1) + a(n-2) + n (mod 3), with a(1)=a(2)=1.at n=18A081410
- Third binomial transform of Fibonacci(n+1).at n=6A081568
- Square array of binomial transforms of Fibonacci numbers, read by ascending antidiagonals.at n=51A081572