10130
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18252
- Proper Divisor Sum (Aliquot Sum)
- 8122
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4048
- Möbius Function
- -1
- Radical
- 10130
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- Number of protruded partitions of n with largest part at most 3.at n=15A005404
- Numbers k such that the continued fraction for sqrt(k) has period 23.at n=42A020362
- Numbers whose base-10 representation has exactly 5 runs.at n=18A043641
- Numbers n such that sum of digits = number of digits.at n=37A061384
- Multiples of 5 with digit sum 5.at n=23A069540
- Triangle T(n,k) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R = (1,0), V = (0,1) and D = (3,1).at n=61A071946
- Fourth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.at n=7A073374
- Triangle read by rows: n-th row contains the first n n-digit multiples of n with digit sum n. If there are fewer than n such numbers, the rest of the row is filled with 0's.at n=11A084029
- Numbers k such that (phi(k-2) + phi(k+2))/2 = phi(k); 2-phi/balanced numbers.at n=21A099633
- Structured octagonal anti-prism numbers.at n=14A100184
- Triangle in A071946 with rows reversed.at n=59A108076
- Even numbers of the form floor( binomial(2k, 2j)/binomial(k, j)).at n=9A111304
- Numbers k such that the k-th triangular number contains only digits {1,3,5}.at n=13A119114
- 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, 1), (0, 1, 0), (1, 0, 1), (1, 1, -1)}.at n=8A149969
- Sum of increasing powers of divisors: a(n) = Sum_{i=1..q} d(i)^i where d(1) < d(2) < ... < d(q) are the divisors of n.at n=9A180851
- Numbers which may represent a date in "condensed European notation" DDMMYY.at n=30A213182
- Numbers which may represent a date in "condensed American notation" MMDDYY.at n=30A213184
- Numbers with exactly 11 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=6A213318
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=31A229467
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 595", based on the 5-celled von Neumann neighborhood.at n=21A273142