10279
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10840
- Proper Divisor Sum (Aliquot Sum)
- 561
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9720
- Möbius Function
- 1
- Radical
- 10279
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 148
- 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
- a(n) = n*(3*n^2 - 1)/2.at n=19A004188
- Pseudoprimes to base 15.at n=20A020143
- Numbers with exactly five distinct base-10 digits.at n=29A031987
- Number of anagrams of a(n) that are prime increases.at n=13A046888
- a(n) is the least integer that has exactly n anagrams that are primes.at n=23A046890
- Values of n where number of permutations of digits a(n) that are prime increases.at n=15A046891
- a(n) is the least number with exactly n permutations of digits that are primes.at n=34A046893
- Primeval numbers: numbers that set a record for the number of distinct primes that can be obtained by permuting some subset of their digits.at n=18A072857
- Numbers k such that the reverse of the representation of phi(k) is a substring of k, in base 10.at n=9A113622
- Sum of the odd parts in all partitions of n into distinct parts.at n=35A116682
- Sum of the sizes of the blocks containing the element 1 in all set partitions of {1,2,...,n}.at n=8A124427
- Number of right triangles with nonnegative integer coordinates less than or equal to n and one corner at the origin.at n=43A155154
- Number of binary strings of length n with no substrings equal to 0010 0110 or 1100.at n=14A164498
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=24A181884
- Truncated octahedron with faces of centered polygons.at n=9A193228
- Row sums of an irregular triangle read by rows in which row n lists the next A026741(n+1) natural numbers A000027.at n=36A195309
- Number of 0..n arrays x(0..9) of 10 elements with zero 5th differences.at n=33A200446
- Nonprime numbers with all divisors with additive digital root of 1.at n=28A211822
- Values of n such that L(14) and N(14) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=30A227517
- Semiprimes which have one or more occurrences of exactly five different digits.at n=5A235693