10533
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14048
- Proper Divisor Sum (Aliquot Sum)
- 3515
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7020
- Möbius Function
- 1
- Radical
- 10533
- 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
- 42
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 68.at n=30A031566
- Denominators of continued fraction convergents to sqrt(172).at n=9A041317
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 22.at n=34A051963
- Numbers k such that 2^k mod k = 2^k mod k^2.at n=28A068535
- Wieferich numbers (1): n > 1 such that 2^A000010(n) == 1 (mod n^2).at n=4A077816
- Convolutory inverse of signed lower Wythoff sequence.at n=16A078140
- Numbers k that are not powers of 2 such that 2^k mod k = 2^k mod k^2; or A068535 with powers of 2 excluded.at n=14A125773
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (1, -1, -1), (1, 0, 0), (1, 1, -1)}.at n=10A148138
- Numbers m such that m^2 divides 2^k - 1 for some k, 0 < k <= m.at n=7A246503
- Numbers n > 1 such that 2^m == 1 (mod n^2), where m = A002326((n-1)/2).at n=3A265630
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.at n=58A267328
- Number of nX(n+4) arrays of permutations of n+4 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.at n=3A267332
- Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 4 and the upper left element equal to 0.at n=7A267333
- Numbers n > 1 such that 2^lambda(n) == 1 (mod n^2), where lambda(n) is the Carmichael lambda function (A002322).at n=4A291961
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=13A316688
- Numbers k such that k^2 | A038199(k).at n=28A317475
- Numbers m such that numbers m, m + 1, m + 2 and m + 3 have k, 2k, 3k and 4k divisors respectively.at n=7A340157
- Numbers k such that 24*k-1 has at least three factors 7 and the partition function evaluated at k has at least the same number of factors 7 as 24*k-1.at n=12A340957
- Numbers k such that the ring of integers of Q(2^(1/k)) is not Z[2^(1/k)].at n=11A342390
- a(n) = Sum_{k=1..n} (n/gcd(k,n))^gcd(k,n).at n=25A342422