12305
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15552
- Proper Divisor Sum (Aliquot Sum)
- 3247
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9328
- Möbius Function
- -1
- Radical
- 12305
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 156
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 10000*log_10(n) rounded up.at n=16A004230
- sin(tan(arctanh(x)))=x+3/3!*x^3+41/5!*x^5+1019/7!*x^7+12305/9!*x^9...at n=4A012175
- Expansion of e.g.f.: exp(tanh(arctan(x)))=1+x+1/2!*x^2-3/3!*x^3-15/4!*x^4+41/5!*x^5...at n=9A012256
- If d,e are consecutive digits of n in base 7, then |d-e|>=5.at n=36A032995
- Sum of the lengths of the cycle types of the permutation created by length sorting on the partitions of n.at n=33A036056
- Numerators of continued fraction convergents to sqrt(537).at n=8A042026
- Smallest multiple of n that begins with the concatenation of the divisors of n (in increasing order).at n=22A078218
- Numbers k such that if P = 10*k^2+1, then P, P+6, P+12 and P+18 are all primes.at n=33A092446
- 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, -1, 1), (-1, 1, 0), (1, -1, 0), (1, 1, 0)}.at n=8A149528
- Products of 3 distinct safe primes.at n=29A157354
- Partial sums of A247666.at n=46A253767
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 315", based on the 5-celled von Neumann neighborhood.at n=25A271248
- Numbers n such that sigma(n^3) is the sum of two positive cubes.at n=31A281364
- Length of n-th iterate of the mapping 00->0010, 01->010, 10->000, starting with 00.at n=15A289019
- Least composite number k such that there are n digits in the intersection of the sets of digits of k and of the juxtaposition of prime factors of k (apart from multiplicity).at n=5A358003
- Number of integer partitions of n whose run-sums are not all equal.at n=34A382076
- Consecutive states of the linear congruential pseudo-random number generator (31481*s+21139) mod 10^5 when started at s=1.at n=16A384341