15698
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 8494
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7636
- Möbius Function
- -1
- Radical
- 15698
- Omega Function (Ω)
- 3
- 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
- 128
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for Cr3Si, Cr position.at n=32A009928
- Denominators of continued fraction convergents to sqrt(808).at n=13A042559
- Obtainable by applying +, * and exponentiation to its own digits.at n=28A046469
- Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.at n=41A056750
- Rhonda numbers to base 10.at n=11A099542
- a(n) = 144*n^2 - 161*n + 45.at n=10A156711
- Integers N such that by inserting + or - or * or / or ^ between each of their digits, without any grouping parentheses, you can get N (the ambiguous a^b^c is avoided).at n=13A156954
- Integers n such that by inserting between their digits + or - or * or / or ^ or nothing (i.e., concatenate two digits) you recover n back in a nontrivial way.at n=15A157198
- First string of 43 consecutive composite numbers.at n=14A177949
- a(n) is the minimal k such that nextprime(2k+1) - 2k = prime(n) where nextprime(n) is least prime > n.at n=20A229512
- Numbers k such that 3*R_k + 10^k - 2 is prime, where R_k = 11...11 is the repunit (A002275) of length k.at n=11A259050
- Expansion of Product_{k>=1} 1/((1-x^(3*k-1))*(1-x^(3*k-2)))^k.at n=29A262883
- First row of A262057.at n=46A265316
- Numbers missing from A001032 despite satisfying the necessary congruence conditions (see comments).at n=39A274469
- Numbers such that the product of their digits is equal to 10 times the sum of their prime factors, without multiplicity.at n=4A306313
- a(n) = Sum_{d|n} (d!)^(n/d-1).at n=14A356543
- Numbers that can be represented using their digits in the order of appearance, the operations +, -, *, /, ^, and any parentheses.at n=35A386936