12458
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18690
- Proper Divisor Sum (Aliquot Sum)
- 6232
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6228
- Möbius Function
- 1
- Radical
- 12458
- 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
- 125
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = floor( Sum_{1 <= i < j <= n} ((sqrt(j)-sqrt(i))^3) ).at n=40A025197
- Base-7 palindromes that start with 5.at n=25A043019
- CIK transform of partition numbers A000041.at n=12A055890
- Numbers k such that 6*R_k - 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=23A098088
- Triangle read by rows: Each row is constructed by forming the partial sums of the previous row, reading from the right and at every third row repeating the final term.at n=40A099961
- Second column of triangle in A099961.at n=11A099967
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and vertical height (i.e., number of rows) k (1 <= k <= n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=32A121692
- Number of base 22 n-digit numbers with adjacent digits differing by four or less.at n=4A126517
- a(n) is the concatenation in increasing order of all single-digit divisors of n.at n=39A129476
- 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, 0), (0, 0, -1), (1, 1, 0), (1, 1, 1)}.at n=7A150921
- a(n) = 169*n^2 - 140*n + 29.at n=8A156639
- Number of 0..7 arrays of length n with each element differing from at least one neighbor by 2 or more.at n=4A221523
- T(n,k)=Number of 0..k arrays of length n with each element differing from at least one neighbor by 2 or more.at n=59A221524
- Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 2 or more.at n=6A221525
- Deficient numbers whose aliquot sequence is deficient, abundant, deficient, ..., etc.at n=10A234970
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 411", based on the 5-celled von Neumann neighborhood.at n=25A271891
- Numbers missing from A001032 despite satisfying the necessary congruence conditions (see comments).at n=28A274469
- Numbers missing from A134419 despite satisfying the necessary congruence conditions (see comments).at n=34A274471
- a(n) = A273059(4n+2).at n=19A275918
- Number of partitions of n such that the (sum of distinct odd parts) > n/2.at n=42A284614