10123
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10368
- Proper Divisor Sum (Aliquot Sum)
- 245
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9880
- Möbius Function
- 1
- Radical
- 10123
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 179
- 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) is the smallest positive number such that the sum of A001032(n) consecutive squares starting with a(n)^2 is a square.at n=48A007475
- a(n) = floor( n*(n-1)*(n-2)/5 ).at n=38A011887
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=33A020445
- Positive numbers having the same set of digits in base 4 and base 10.at n=37A037428
- Denominators of continued fraction convergents to sqrt(303).at n=7A041571
- Numbers whose base-10 representation has exactly 5 runs.at n=11A043641
- a(n) is the least number with exactly n permutations of digits that are primes.at n=15A046893
- Bessel function Y_0(n) is a monotonically decreasing positive sequence.at n=22A046961
- Bessel function |Y_0(n)| is a monotonically decreasing positive sequence.at n=38A046963
- a(n) is the first square root greater than 10^n such that a(n)^2 is a palfree square (palfree = contains no palindromic substring except single digits).at n=3A052065
- Coefficients of monic irreducible polynomials over GF(4) listed in lexicographic order.at n=31A058948
- Coefficients of monic primitive irreducible polynomials over GF(5) listed in lexicographic order.at n=27A058950
- Coefficients of monic primitive irreducible polynomials over GF(4) listed in lexicographic order.at n=18A058952
- Half the number of 3 X n binary arrays with no path of adjacent 1's or adjacent 0's from top to bottom or side to side.at n=4A069448
- Half the number of 6 X n binary arrays with no path of adjacent 1's or adjacent 0's from top to bottom or side to side.at n=1A069451
- 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=14A072857
- Least number whose digits can be used to form exactly n different primes (not necessarily using all digits).at n=35A076449
- A000041(n)-A000010(n).at n=32A086739
- a(n) = smallest k such that the Reverse and Add! trajectory of A063048(n) joins the trajectory of k.at n=20A089493
- Each digit of a(n) appears in a(n+1) and a(n+1) > a(n) is minimal.at n=33A107411